// By Stefan Radu

#include <algorithm>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <string>
#include <cctype>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <map>
#include <set>

using namespace std;

ifstream cin("sdo.in");
ofstream cout("sdo.out");

#define sz(x) (int)(x).size()

typedef pair < int, int > pii;
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

int getKth(int st, int dr, vector < int > &v, int k) {

  int piv = rand() % (dr - st + 1) + st;
  swap(v[piv], v[dr]);

  int ind = st, last = dr - 1;
  while (ind <= last) {
    if (v[ind] > v[dr]) {
      swap(v[ind], v[last --]);
      continue;
    }
    ++ ind;
  }

  swap(v[dr], v[ind]);

  if (ind - st + 1 == k) return v[ind];

  if (ind - st + 1 < k) return getKth(ind + 1, dr, v, k - ind + st - 1);
  return getKth(st, ind - 1, v, k);
}

int main() {

#ifdef STEF
  freopen("input", "r", stdin);
  freopen("output", "w", stdout);
#endif

  ios::sync_with_stdio(false);
  cin.tie(0);cout.tie(0);

  int n, k;
  cin >> n >> k;

  vector < int > v(n);
  for (int &x : v) cin >> x;

  cout << getKth(0, n - 1, v, k) << '\n';
}