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