#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int x[3000003];
void schimba( int &a, int &b)
{
    int aux = a;
    a = b;
    b = aux;
}

void citire(int &n, int &k)
{
    int i;
    f >> n >> k;
    for (i = 1; i <= n; i++)
    {
        f >> x[i];
    }
}

void afisare(int a, int n)
{
    for(int i = a; i <= n; i++)
        g << x[i] << " ";
}

int quick(int st, int dr)
{
    int i, j = st-1, piv = (st + dr) / 2, mij = x[piv];
    for(i = st; i <= dr; i++)
    {
        if(x[i] < mij)
        {
            j++;
            if(j == piv)
                piv = i;
            schimba(x[i], x[j]);
        }
    }
    schimba(x[j + 1], x[piv]);
    return j+1;

}

void QuickSort(int st, int dr, int k)
{
    if(st <= dr)
    {
        //afisare(st, dr);
        if(k != 0)
        {
            int piv = quick(st, dr);
            if(piv == st == k)
            {
                g << x[piv];
                return;
            }
            if(piv - st >= k)
            {
                QuickSort(st, piv - 1, k);
            }
            else
            {
                k = k - (piv - st + 1);
                if(piv == dr)
                {
                    g << x[piv];
                    return;
                }
                QuickSort(piv + 1, dr, k);
            }
        }
        else
            g << x[dr];
    }
}
int main()
{
    int n, k;
    citire(n, k);
    if( n == 1)
        g << x[1];
    else
        QuickSort(1, n, k);
    return 0;

}