#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
vector <int> a;
int n,k;
int partition(int st,int dr)
{
	int i=st-1,j=dr+1,q=a[(st+dr)/2];
	while(1)
	{
		do
		{
			i++;
		}while(a[i]<q);
		do
		{
			j--;
		}while(q<a[j]);
		if(i<j)
			swap(a[i],a[j]);
		else
			return j;
	}
	return 'oO';
}
int sdo(int st,int dr,int ind)
{
	if(st==dr)
		return a[st];
	int q=partition(st,dr);
	k=q-st+1;
	if(ind<=k)
		return sdo(st,q,ind);
	else
		return sdo(q+1,dr,ind-k);
}
int main()
{
	freopen("sdo.in","r",stdin);
	freopen("sdo.out","w",stdout);
	scanf("%d%d",&n,&k);
	for(int i=0;i<n;i++)
	{
		int x;
		scanf("%d",&x);
		a.push_back(x);
	}
	printf("%d\n",sdo(0,n-1,k));
	return 0;
}