#include <iostream>
#include <string>
#include <vector>
#include <numeric>
#include <cassert>
#include <algorithm>
#include <map>
#include <cstdio>
#define out(x) cout<<x<<endl;
using namespace std;
#define re return 0;
typedef long long ll; 
#define rep(i,n) for(ll i=0;i<n;++i)
#define loop for(;;)
map<int,ll> mp;
int main(){
    int n,k;
    cin >> n >> k;
    vector<int> p(n);
    for(int i = 0;i < n;i++){
        cin >> p[i];
    }
    sort(p.begin(),p.end());
    int ans = 0;
    for(int i=0;i<k;i++){
        if(p[i] != p[i+1] || p[i] != p[i+2])
            ans = p[i];
    }
    out(ans);
    re;
}