#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

ifstream f("sdo.in");
ofstream g("sdo.out");

vector<int> v;
int N,K;

int main()
{
	int x;
	f >> N >> K;
	for(int i = 0; i < N; i++) {
		f >> x;
		v.push_back(x);
	}
	sort(v.begin(), v.end());
	g << v[K - 1];
}