#include <fstream>
#include <algorithm>

using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int X[3000005];
int main()
{
    int n, k, i;
    fin>>n>>k;
    for (i=1; i<=n; i++)
        fin>>X[i];
    sort (X+1, X+n+1);
    fout<<X[k];
    return 0;
}