#include <iostream>

using namespace std;

const int N = 1e5 + 10;

int q[N];

int quick_sort(int q[], int l, int r, int k)
{
    if(l >= r) return q[l];

    int i = l - 1, j = r + 1, x = q[l + r >> 1];
    while(i < j)
    {
        while(q[++ i] < x);
        while(q[-- j] > x);
        if(i < j) swap(q[i], q[j]);
    }

    if(k > j - l + 1) return quick_sort(q, j + 1, r, k - (j - l + 1));
    else return quick_sort(q, l, j, k);
}

int main()
{
    int n, k;
    scanf("%d%d", &n, &k);

    for(int i = 1;i <= n;i++) scanf("%d", &q[i]);

    cout << quick_sort(q, 1, n, k) << endl;
    return 0;
}