#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
long long final = 0;
long long sum = 0;
long a[1000000];
long n, k;
using namespace std;
int main() 
{
    cin>>n>>k;
    for(int i = 0; i<n; i++)
        cin>>a[i];
    long min = a[0];
    for(int j = 1; j<n; j++)
        if(a[j]<min)
            min = a[j];
    cout<<min<<endl;
    return 0;
}