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

using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,k;
vector <int> v;
int main()
{
    f>>n>>k;
    for(int i=1;i<=n;i++){
 int x;
        f>>x;
        v.push_back(x);
    }
    nth_element(v.begin(),v.begin()+k-1,v.end());
    g<<v[k-1]<<'\n';
    return 0;
}