#include <bits/stdc++.h>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
const int NMAX = 3e6+1;
int a[NMAX], n, k;
int main()
{
	f >> n >> k;
	for (int i = 1; i <= n; i++)
		f >> a[i];
	sort(a+1, a+1+n);
	g << a[k] << '\n';
	return 0;
}