#include <fstream>
#include<algorithm>
using namespace std;
int v[3000005],n,k;
int main()
{
    ifstream fin("sdo.in");
    ofstream fout("sdo.out");
     int i;
     fin>>n>>k;
     for(i=1;i<=n;i++)
    fin>>v[i];
    sort(v+1,v+n+1);
    for(i=1;i<=n;i++)
      if(i==k)
      {fout<<v[i]<<"\n";
      return 0;
      }
    fin.close();
    fout.close();
}