#include <bits/stdc++.h>

using namespace std;

ifstream fin("sdo.in");
ofstream fout("sdo.out");

int n, k;
vector<int> v;
priority_queue<int> pq;

int main(){
fin>>n>>k;
int x;
for (int i = 0; i < n; i++){
    fin>>x;
    v.push_back(x);
}
for (int i = 0; i < k; i++){
    pq.push(v[i]);
}
for (int i = k; i < v.size(); i++){
    if (v[i] >= pq.top())
        continue;
    else{
        pq.pop();
        pq.push(v[i]);
    }
}
fout << pq.top();
    return 0;
}