#include<stdio.h>
#include<time.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;

int v[3000010],i,p,u,k,n,m;

int part(int v[],int li,int lf){
int s=li,i,p,d = lf;
p = v[li + (rand()%(lf-li+1))];
while(1){
while(v[s] < p)s++;

while(v[d] > p)d--;

if(s < d) swap(v[s],v[d]);
else
	return d;
}

}


int main(){
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);

scanf("%d %d",&n,&k);

for(i = 1; i <= n ; i++)
	scanf("%d",&v[i]);

srand(time(0));
p = 1; u = n;
while(true){
	m = part(v,p,u);
	if(m == k){printf("%d",v[k]);return 0;}
	else
	if(m > k){u = m - 1;}
	else
	p = m + 1;
	}


return 0;}