#include <fstream>
#include <algorithm>
#include <ctime>

using namespace std;

const int NMax = 3000010;

int ans;
int n, K;
int a[NMax];

inline void nth(const int st, const int dr, const int k)
{
    if (st == dr)
    {
        ans = a[st];
        return ;
    }
    int poz = (rand() % (dr - st + 1)) + st;
    int i = st, j = dr;
    int x = a[poz];
    while (i <= j)
    {
        while (a[i] < x)
            ++i;
        while (a[j] > x)
            --j;
        if (i <= j)
        {
            swap(a[i], a[j]);
            ++i, --j;
        }
    }
    if (j - st + 1 < k)
        nth(j+1, dr, k - (j-st+1));
    else
        nth(st, j, k);

}

int main()
{
    srand(time(NULL));
    ifstream f ("sdo.in");
    f>>n>>K;
    for (int i = 1; i<=n; ++i)
        f>>a[i];
    f.close();
    nth(1, n, K);
    ofstream g("sdo.out");
    g<<ans<<"\n";
    g.close();
    return 0;
}