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

using namespace std;

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

const int MAX_SIZE = 10001;
const int MAX_N = 100001;
vector< vector <int> > a(MAX_SIZE);
int k;

void read()
{
    int n, y;
    cin >> n >> k;
    for (int i=0; i < n; i++)
    {
        cin >> y;
        a[y/MAX_N].push_back(y);
    }
}

int solve()
{
    int i = 0;
    while (a[i].size() < k) {
        k -= a[i].size();
        i++;
    }
    sort(a[i].begin(), a[i].end());
    return a[i][k-1];
}

main()
{
    read();
    cout<<solve();
}