#include<bits/stdc++.h>
using namespace std;
const int N=100010;
int a[N];
int qsort(int l,int r,int k)
{
    if(l==r)return a[l];
    //l+=rand()%(r-l+1); 
    int x=a[l];
    int i=l,j=r;
    while(i<j)
    {
        while(i<j && a[j]>x)j--;
        if(i<j)
        {
            a[i]=a[j];
            i++;
        }
        while(i<j && a[i]<x)i++;
        if(i<j)
        {
            a[j]=a[i];
            j--;
        }
    }
    a[i]=x;
    if(i-l+1>=k)
        qsort(l,i,k);
    else
        qsort(i+1,r,k-(i-l+1));

}
int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    cout<<qsort(1,n,k)<<endl;
    return 0;
}