#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");

vector <int> v[10005];
int n,k,mod=100000,i,x;
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)
    {
        f>>x;
        v[x/mod].push_back(x);
    }
    for(i=0;i<=10000;i++)
    {
        x=v[i].size();
        if(k-x<=0)
            break;
        else
            k-=x;
    }
    sort(v[i].begin(),v[i].end());
    g<<v[i][k-1];



    return 0;
}