#include<stdio.h>
#include<algorithm>
using namespace std;
long long i,n,p;
FILE *f,*g;
int main()
{
f=fopen("sort3.in","r");
g=fopen("sort3.out","w");
fscanf(f,"%lld",&n);
fscanf(f,"%lld",&p);
long long v[n+1];
for(i=1;i<=n;i++)
	fscanf(f,"%lld",&v[i]);
sort(v+1,v+n+1);
//for(i=1;i<=n;i++)
	//fprintf(g,"%lld ",v[i]);
fprintf(g,"%lld ",v[p]);
fclose(f);
fclose(g);
return 0;
}