#include <fstream>
#include <algorithm>
#include <set>

using namespace std;

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

const int N_MAX = 3000002;
int N, v[N_MAX], elem;
/*
int main()
{
    in >> N >> elem;
    for (int i = 1; i <= N; ++i)
        in >> v[i];
    sort (v+1, v+N+1);
    out << v[elem] << '\n';
    in.close(); out.close();
    return 0;
}*/

set <int> s;

int main(){
    in >> N >> elem;
    for (int i = 1; i <= N; ++i){
        int x; in >> x;
        s.insert(x);
    }
    set<int>::iterator it = s.begin();
    while (--elem)
    {
        s.erase(it);
        it = s.begin();
    }
    out << *(s.begin());
}