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

using namespace std;

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