//
//  main.cpp
//  HackerRank-101Hack42
//
//  Created by BahadirAltun on 18/10/16.
//  Copyright © 2016 Bahadir Altun. All rights reserved.
//

#include <algorithm>
#include <iostream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <map>
#include <set>

using namespace std;

#define mid ((lf + rg) >> 1)
#define right (left | 1)
#define left (v << 1)

typedef pair<long long, long long> pii;
typedef long long ll;

const ll linf = 1e18 + 9;
const long long inf = 1e9 + 9;
const long long N = 5e5 + 9;

ll n, a[N], k;

int main() {

  scanf("%lld %lld", &n, &k);

  ll mn = linf;

  for (int i = 1; i <= n; i++) { scanf("%lld", &a[i]); mn = min(mn, a[i]); }

  cout << mn << endl;

  return 0;
}