#include <fstream>
#include <ctime>
#include <cstdlib>
#define maxn 3000001

using namespace std;

ifstream fin ("sdo.in");
ofstream fout ("sdo.out");

int v[maxn];

void exchange (int i, int j)
{
    int temp = v[i];
    v[i] = v[j];
    v[j] = temp;
}

int Selection (int p, int q, int k)
{
    if (q==p) return v[p];

    int x=v[rand()%(q-p+1)+p],i=p-1,j=q+1,f=p,l=q;
    while (i<j)
    {
        do i++; while (v[i]<x);
        do j--; while (v[j]>x);
        if (i>=j) break;
        exchange (i,j);
        if (v[i]==x) {exchange (i,f); ++f;}
        if (v[j]==x) {exchange (j,l); --l;}
    }

    if (l!=q) {exchange (q,i);}
    else if (f!=p) {exchange (p,j); i=j;}

    int currentk=i-p+1;

    if (k==currentk) return v[i];
    else if (k<currentk) return Selection (p,i-1,k);
    else return Selection (i+1,q,k-currentk);
}

int main()
{
    int n,k;
    srand (time(NULL));

    fin>>n>>k;
    for (int i=1; i<=n; ++i) fin>>v[i];

    fout<<Selection (1,n,k);
}