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

using namespace std;

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

int main()
{
    vector <vector <int> > a;
    int n, k;
    cin >> n >> k;
    a.resize(10001);
    k--;

    for (int x, i = 0; i < n; i++)
    {
        cin >> x;
        a[x / 100001].push_back(x);
    }

    int i = 0;
    while (k >= a[i].size())
        k -= a[i].size(), i++;

    sort(a[i].begin(), a[i].end());

    cout << a[i][k];

    return 0;
}