#include <fstream>
#include <vector>
#include <string>
#include <algorithm>
#include <stdlib.h>
#include <stack>
#include <queue>
#include <iomanip>
#include <time.h>
#define inf 1<<30
//#define x first
#define y second
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int i,j,n,m,a,b,c,st,dr,v[3000005],nr;
int pivot(int s, int d)
{

    int x = v[ s + rand() % (d-s) ];
    s--,d++;
    while(1)
    {
        do{
            d--;
        }while(v[d] > x);

        do{
            s++;
        }while(v[s] < x);
        if(s < d)
            swap(v[s],v[d]);
        else
            return d;
    }
}
int findd(int s, int d, int i)
{
    if(s==d)
        return v[s];
    int q = pivot(s,d);
    int k = q - s + 1;
    if(k >= i)
        findd(s,q,i);
    else
        findd(q + 1,d,i-k);
}
int main()
{
    srand(time(NULL));
    fin >> n >> m;
    for(i = 1; i <= n; i++)
        fin >> v[i];
    fout<<findd(1,n,m);
return 0;
}