#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
int v[3000000],k,i,n;
int quick(int v[], int st, int dr,int k)
{
    if(st==dr)return v[st];
    int i=st, j=dr, pivot=v[rand()%(dr-st)+st+1],nr;
    while(i<=j)
    {
        while(v[i]<pivot)
            i++;
        while(v[j]>pivot)
            j--;
        if(i<=j)
        {
            int aux=v[i];
            v[i]=v[j];
            v[j]=aux;
            i++;
            j--;
        }
    }
    nr=j-st+1;
    if(nr>=k)return quick(v,st,j,k);
    return quick(v,j+1,dr,k-nr);
}
int main()
{
    ifstream f("sdo.in");
    ofstream g("sdo.out");
    f>>n>>k;
    for(i=1;i<=n;i++)
        f>>v[i];
   g<<quick(v,1,n,k);
    return 0;
}