#include <fstream>
#include <ctime>
#include<iostream>
#include <cstdlib>
#define maxim 3000005
using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");

int a[maxim], n, k;
void citire()
{
    fin >> n >> k;
    for(int i = 1; i <= n; ++i)
        fin >> a[i];
}

int part(int a[maxim], int li, int lf)
{
    int i = li-1, j = lf+1, p = a[li];
    while(1)
    {
        do
        {
        	++i;
        } while(a[i] < p);
        do
        {
            --j;
        } while(p < a[j]);
        if(i < j)
            swap(a[i], a[j]);
        else
            return j;
    }
    return 0;
}
void sel(int a[maxim], int li, int lf, int k)
{
    if(li == lf)
        return;
    int q = part(a, li, lf);
    int t = q-li+1;
    if(t >= k)
        sel(a, li, q, k);
    else
        sel(a, q+1, lf, k-t);
}

int main()
{
    citire();
    sel(a, 1, n, k);

    fout << a[k] << "\n";
    system("Pause");
}