#include <cstdio>
#include <algorithm>

using namespace std;

int v[3000010];

void al_k_lea_min(int k,int st,int dr)
{
    int i=st,j=dr,a=v[(st+dr)/2];
    if(st>=dr) return;
    while(i<=j)
    {
        while(v[i]<a) i++;
        while(v[j]>a) j--;
        if(i<=j)
        {
            swap(v[i],v[j]);
            i++;
            j--;
        }
    }
    if(k<=j-st+1) al_k_lea_min(k,st,j);
    else al_k_lea_min(k-(j-st+1),j+1,dr);
}

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