#include <iostream>
#include <bitset>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int a[3000003], n, k;
int main()
{
    int i;
    fin >> n >> k;
    for (i = 1; i <= n; i++)
        fin >> a[i];
    sort (a + 1, a + n + 1);
    fout << a[k];
    return 0;
}