include[HTML_REMOVED]

using namespace std;
const int N=1e6+10;
int q[N];
void quick_sort(int q[],int l,int r)
{

if(l>=r)return ;
int x=q[l], i=l-1,j=r+1;
while(i<j)
{
    do i++;while (q[i]<x);
    do j--; while (q[j]>x);
    if(j>i) swap(q[i],q[j]);

}
quick_sort(q, l,j);
quick_sort(q,j+1,r);

}
int main()
{
int y,t;
scanf(“%d%d”,&y,&t);
for(int p=0;p<y;p++) scanf(“%d”,&q[p]);
quick_sort(q,0,y-1);
printf(“%d”,q[t-1]);

return 0;

}