#include<fstream>
using namespace std;
int i,t[3000001],n;

void Quick(int st,int dr, int k )
 
{     int i=st,j=dr,w,piv=t[(i+j)/2];

   
 do   {
	  while(t[i] < piv) i++; 
	  while(t[j] > piv) j--;
      if(i <= j) {w=t[i]; t[i]=t[j]; t[j]=w; i++; j--;}
      }
  while(j >= i);
 
	if(st < j) {
		if( j - st + 1  >= k ) // daca elementul e in stanga
			Quick(st,j,k);
	}
	 if(dr > i) 
	 {
		 if( j - st + 1 < k )// daca elementul e in dreapta
			Quick(i,dr,  k - ( j - st  + 1 ));// il scad pe k cu cate elemente sunt in stanga
	 }
 }

int main()
{
	ifstream fin("sdo.in");
	ofstream fout("sdo.out");	
    int k;
    fin>>n>>k;

    for(i=1;i<=n;i++)
      fin>>t[i];
    Quick(1,n,k);

    fout<<t[k];
}