#include<fstream>
#include <cstdlib>
#include<algorithm>
using namespace std;
int a[3000005];
int partition(int p,int r)
{
 int i,j,pivot;
 pivot=a[p+(rand()%(r-p+1))];
 i=p-1;
 j=r+1;
 while(1)
 {
  do i++; while(a[i]<pivot);
  do j--; while(a[j]>pivot);
  if(i<j) swap(a[i],a[j]); else return j;
 }
 return 0;
}
int select(int p,int r, int k)
{
 int q;
 if(p==r) return a[p];
 q=partition(p,r);
 if(q-p+1>=k) return select(p,q,k); else return select(q+1,r,k-q+p-1);
} 
int main()
{
 int i,n,k;
 srand(time(NULL));
 ifstream fi("sdo.in");
 ofstream fo("sdo.out");
 fi>>n>>k;
 for(i=1;i<=n;i++) fi>>a[i];
 fo<<select(1,n,k);
 fo.close(); 
 return 0;
}