#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int v[3000005],n,k,x;

int main()
{
	freopen("sdo.in","r", stdin);
	freopen("sdo.out","w", stdout);
	scanf("%d %d",&n,&k);
	//cout<<n<<" "<<k;
	for(int i=1;i<=n;i++)
	{
		scanf("%d ",&x);
		if(v[i-1]<x) v[i]=x;
		else
		{
			for(int j=i-1;j>=1;j--)
			{
				if(v[j]<x)
				{
					for(int r=i;r>j;r--) v[r]=v[r-1];
					//cout<<" Pentru elementul " <<x<<endl;
					//for(int i=1;i<=n;i++) cout<<v[i]<<" ";
					v[j+1]=x;
					break;
				
				}
			
			}
		//	cout<<endl;
		}
	}
	//for(int i=1;i<=n;i++) cout<<v[i]<<endl;
	printf("%d",v[k]);

	return 0;
}