#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("sdo.in");
ofstream fout("sdo.out");

   
       long long v[3000000];

int main()
{
    
    long long k, m, n;
    fin >> n >> k;
 
    
    for (int i = 1; i <= n; ++i)
    
        fin >> v[i];
        
    nth_element(v + 1, v + k, v + n + 1);
    
        fout << v[k] << ' ';
    
   
    return 0;
}