#include <cstdio>
#include <fstream>
#include <algorithm>

using namespace std;
int n,k,i,L,R,st,dr,mi,v,aux,X[3000001];
ifstream f("sdo.in");
ofstream g("sdo.out");
int main()
{

   /*freopen("sdo.in","r",stdin);
   freopen("sdo.out","w",stdout);*/
   f>>n>>k;
   //scanf("%d%d",&n,&k);
   for(i=1;i<=n;i++)f>>X[i];
   L=1;R=n;
   nth_element(X+1,X+k,X+n+1);
   g<<X[k];
    return 0;
}