#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,greater<int>, rb_tree_tag,tree_order_statistics_node_update>
const int MAXN = (1e6) + 7;
vector< int > adj[MAXN];
set < int > st;
int deg[MAXN];
int vis[MAXN];
void ALI_72(){
int n,m;
cin>>n>>m;
ordered_set o;
int val;
for(int i=1;i<=n;i++){
cin >> val;
o.insert(val);
if(i>=m){
cout<<*(o.find_by_order(m-1))<<endl;
}
}
}
signed main()
{
ios_base :: sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t = 1;
//cin >> t;
while(t--){
ALI_72();
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNpbmNsdWRlIDxleHQvcGJfZHMvYXNzb2NfY29udGFpbmVyLmhwcD4KI2luY2x1ZGUgPGV4dC9wYl9kcy90cmVlX3BvbGljeS5ocHA+CnVzaW5nIG5hbWVzcGFjZSBfX2dudV9wYmRzOwoKI2RlZmluZSBvcmRlcmVkX3NldCB0cmVlPGludCwgbnVsbF90eXBlLGdyZWF0ZXI8aW50PiwgcmJfdHJlZV90YWcsdHJlZV9vcmRlcl9zdGF0aXN0aWNzX25vZGVfdXBkYXRlPgoKY29uc3QgaW50IE1BWE4gPSAoMWU2KSArIDc7CnZlY3RvcjwgaW50ID4gYWRqW01BWE5dOwpzZXQgPCBpbnQgPiBzdDsKaW50IGRlZ1tNQVhOXTsKaW50IHZpc1tNQVhOXTsKdm9pZCBBTElfNzIoKXsKICAgIGludCBuLG07CiAgIGNpbj4+bj4+bTsKICAgb3JkZXJlZF9zZXQgbzsKICAgaW50IHZhbDsKICAgZm9yKGludCBpPTE7aTw9bjtpKyspewogICAgY2luID4+IHZhbDsKICAgIG8uaW5zZXJ0KHZhbCk7CiAgICAgICBpZihpPj1tKXsKICAgICAgICAgICAgY291dDw8KihvLmZpbmRfYnlfb3JkZXIobS0xKSk8PGVuZGw7CiAgICAgICB9CgogICB9Cn0KCnNpZ25lZCBtYWluKCkKewogICAgaW9zX2Jhc2UgOjogc3luY193aXRoX3N0ZGlvKDApOwogICAgY2luLnRpZSgwKSwgY291dC50aWUoMCk7CiAgICBpbnQgdCA9IDE7CiAgICAvL2NpbiA+PiB0OwogICAgd2hpbGUodC0tKXsKICAgIEFMSV83MigpOwogICB9CgogICAgcmV0dXJuIDA7Cn0K