#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;

int rez,n,i,j,k,v[3000005];

int Quick(int st,int dr,int x)
{
    if (st==dr) return v[st];
    int mij=(st+dr)/2;
    int pivot=v[mij];
    int i=st;
    int j=dr;
    while (i<=j)
    {
        while (v[i]<pivot) i++;
        while (v[j]>pivot) j--;
        if (i<=j)  v[i]=v[i]^v[j]^(v[j]=v[i]),i++,j--;
    }
        if (j-st+1>=x) return Quick(st,j,x);
    return Quick(j+1,dr,x-(j-st+1));
}

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