#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int partition(vector<int>& v, int left, int right) {
  int nextPz = left;
  int pivot = v[right];

  for (int i = left; i <= right; ++i)
    if (v[i] <= pivot) {
      swap(v[nextPz], v[i]);
      ++nextPz;
    }

  return nextPz - 1;
}
  
int nthElement(vector<int>& v, int left, int right, int position) {
  int pivotPos = partition(v, left, right);
  if (pivotPos == position)
    return v[pivotPos];

  if (pivotPos > position)
    return nthElement(v, left, pivotPos - 1, position);

  return nthElement(v, pivotPos + 1, right, position); 
}

int main() {

  freopen("sdo.in", "r", stdin);
  freopen("sdo.out", "w", stdout);

  int N, K;

  scanf("%d%d", &N, &K);
  --K;
  
  vector<int> v(N);
  for (int i = 0; i < N; ++i)
    scanf("%d", &v[i]);

  printf("%d\n", nthElement(v, 0, (int)v.size() - 1, K));
  
  
  return 0;
}