#include<bits/stdc++.h>
using namespace std;
int n , a[10000005];
void quick_sort(int l , int r){
    if(l >= r)
        return;
	int mid = a[l] , i = l , j = r;
    while(i < j){
        while(i < j && a[j] >= mid)
            j--;
        while(i < j && a[i] <= mid)
            i++;
        swap(a[i] , a[j]);
    }
    a[l] = a[i];
    a[i] = mid;
    quick_sort(l , i-1);
    quick_sort(i+1 , r);
}
int main(){
	int n , z;
	cin >> n >> z;
	for(int i = 0;i < n;i++){
		cin >> a[i];
	} 
	quick_sort(0 , n-1);
	cout << a[z];
	return 0;
}