#include<bits/stdc++.h>
using namespace std;
long long n,k,a[10005],cnt = 1;
int main(){
	cin >> n >> k;
	for (int i = 1;i <= n;i++){
		cin >> a[i];
	}
	sort(a + 1,a + n + 1);
   if(k==1)return cout<<a[1],0;
   cnt=1;
	for (int i = 2;i <= n;i++){
		if (a[i] != a[i - 1]){
			cnt++;
		}
		if (cnt == k){
			cout << a[i];
			break;
		}
	}
    return 0;
}