#include <cstdio>
#include <algorithm>
using namespace std;
int a[3000003],k,poz;
int n,i,st,dr,p;
int part(int st,int dr){
int i,j,p;
j=st-1;
p=a[dr];
for(i=st;i<=dr;i++)
if(a[i]<=p)swap(a[++j],a[i]);
return j;
}
int main()
{freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
st=1;dr=n;
while(poz!=k){
poz=part(st,dr);
if(poz>k)dr=poz-1;
else if(poz<k)st=poz+1;
else {printf("%d",a[poz]);break;}
}

    return 0;
}