#include <fstream>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int qsort(int v[300], int inc, int fin)
{
    int i,piv,j;
    i=inc;
    j=fin;
int     k=(i+j)/2;
    piv=v[k];
    while(i<=j)
    {
        while(v[i]<piv)i++;
        while(v[j]>piv)j--;
                if(i<j)
{
        swap(v[i], v[j]);
        i++;
        j--;
}
    }
    if(inc<j) qsort(v, inc, j);
    if(fin>i) qsort(v, i, fin);
}
int main()
{
int v[300],n,i,inc,fin,k;
f>>n>>k;
for(i=1; i<=n; i++) f>>v[i];
inc=1;
fin=k;
    qsort(v, inc, fin);

g<<v[k];
return 0;
}