#include <iostream>
#include <fstream>
using namespace std;
int v[100], n,k;
ifstream in("sdo.in");
ofstream out("sdo.out");

int quick(unsigned int li, unsigned int ls)
{ int stg=li, dr=ls, x=v[li], aux;
while (stg<dr)
    {while (stg<dr && v[dr]>x)
       dr--;
    v[stg]=v[dr];
    while(stg<dr && v[stg]<x)
        stg++;
   v[dr]=v[stg];
   v[stg]=x;}
return stg;

}

void sortare( unsigned int li, unsigned int ls)
{if(li<ls)
    {int m=quick(li,ls);
    if(m==k)
       out<<v[m];
    else
    if(li<m)
        sortare(li,m-1);
    if(m<ls)
        sortare(m+1,ls);}
}

int main()
{ in>>n>>k;
for(int i=1;i<=n;i++)
    in>>v[i];
sortare(1,n);
    return 0;
}