#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template<typename T, typename Cmp = less<T>>
using ordered_set = tree<T, null_type, Cmp, rb_tree_tag, tree_order_statistics_node_update>;

signed main() {
#ifndef LOCAL
    freopen("sdo.in", "r", stdin);
    freopen("sdo.out", "w", stdout);
    cin.tie(nullptr)->sync_with_stdio(false);
#endif

    int n, k; cin >> n >> k;
    ordered_set<pair<int, int>> s;
    for (int i = 0; i < n; ++i) {
        int nr; cin >> nr;
        s.insert({nr, i});
    }

    cout << s.find_by_order(k-1)->first << '\n';

    return 0;
}