#include <iostream>
#include <fstream>
#include <ctime>
#include <cstdlib>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
int v[3000003],k;
int quickSortsdo( int st , int dr, int k )
{
    if( st == dr)
        return v[ st ];
    srand( time( NULL ) );
    int i = st, j = dr;
    int pivot = v[ st + rand() % ( dr-st+1) ];
    while ( i <= j )
    {
        while( v[i] < pivot )
            i++;
        while( v[j] > pivot )
            j--;
        if( i<=j)
        {
            swap (v[i],v[j]);
            i++;
            j--;
        }
    }
    int dim = j-st+1;
    if (dim >= k) //daca dimensiunea intervalului e mai maare ca k atunci ne deplasam in stanga
        return quickSortsdo(st, j, k);
    return quickSortsdo(j+1, dr, k - dim);//altfel in dreapta si scadem din k dimensiunea
}
int main()
{
    int n;
    in >> n >> k;
    for(int i = 1 ; i <= n; i ++)
    {
        in >> v[i];
    }
    quickSortsdo( 1 , n, k);
    out<<v[k];


    return 0;
}