/*
#include <iostream>
#include <fstream>

using namespace std;

fstream in("sdo.in", ios::in);
fstream out("sdo.out", ios::out);

#define nmax 3000005
long a[nmax];

int main()
{
	int i,j,n,k,x,kk=0,mink=0;

	in>>n>>k;

	for(i=0;i<n;i++)
		in>>a[i];

	for(i=0;i<n-1;i++)
		for(j=i+1;j<n;j++)
			if(a[i]>a[j])
			{
				x=a[i];
				a[i]=a[j];
				a[j]=x;
			}
	i=0;
	while(kk<k)
	{
		if(a[i]>mink)
		{
			mink=a[i];
			kk++;
		}
		i++;
	}

	out<<a[i-1];
	

    in.close();
    out.close();

	return 0;
}

*/


#include<fstream>
#include<algorithm>
 
using namespace std;
 
ifstream fin("sdo.in");
ofstream fout("sdo.out");
 
const int NMax = 3000005;
int N,K,A[NMax];
 
int main()
{
   fin>>N>>K;
 
   for(int i = 1; i <= N; i++)
        fin>>A[i];
 
   nth_element(A+1,A+K,A+N+1);
 
   fout<<A[K]<<" ";
 
    return 0;
}