#include <cstdio>
#include <algorithm>
#include <ctime>

using namespace std;

int v[3000010];

void solve(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) solve(st,j,k);
    else solve(j+1,dr,k-(j-st+1));
}

int main()
{
    freopen("sdo.in", "r", stdin);
    freopen("sdo.out", "w", stdout);
    srand(time(0));
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++) scanf("%d",&v[i]);
    solve(1,n,k);
    printf("%d",v[k]);
    return 0;
}