#include <bits/stdc++.h>
using namespace std;
int a[5000010];
int mysort(int a[],int left,int right,int k){
    if (left>=right) return a[left];
    int i=left,j=right;
    int x=a[left+rand()%(right-left+1)];
    while(i<j){
        while(a[i]<x) i++;
        while(a[j]>x) j--;

        if(i<=j) 
            swap(a[i],a[j]),i++,j--;
    }
    if(k<=j)mysort(a,left,j,k);
    else if(k>=i)mysort(a,i,right,k);
    else mysort(a,j+1,i-1,k);
    
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    cout<<mysort(a,1,n,k+1)<<endl;
    return 0;
}