#include <fstream>
#include <algorithm>

#define nMax 3000005

using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");

int n, k;
int v[nMax];
void read()
{
    fin>>n>>k;
    for(int i=1;i<=n;i++)
        fin>>v[i];
}
void qsort(int st, int dr, int k)
{
    if(st==dr)
        return;
    int x=v[st+rand()%(dr-st+1)], i=st, j=dr;
    while(i<j)
    {
        for(;v[i]<=x;i++);
        for(;v[j]>x;j--);
        if(i<j)
            swap(v[i], v[j]);
    }
    if(k<=j-st+1)
        qsort(st, j, k);
    else
        qsort(j+1, dr, k-(j-st+1));

}
void write()
{
    fout<<v[k];
}
int main()
{
    read();
    qsort(1, n, k);
    write();
    return 0;
}