#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#include <deque>
#include <ctime>
#include <cstdlib>

using namespace std;
const int inf = 1e9 + 5;
const int NMax = 3e6 + 5;
ifstream in("sdo.in");
ofstream out("sdo.out");

#define ll long long
#define ull unsigned long long
#define pb push_back
using zint = int;

int N,K;
int v[NMax];

void solve(int,int,int);
int part(int,int);

int main() {
    in>>N>>K;
    for (int i=1;i <= N;++i) {
        in>>v[i];
    }

    srand(time(0));
    solve(1,N,K);

    out<<v[K]<<'\n';

    in.close();out.close();
    return 0;
}

void solve(int st,int dr,int k) {
    if (st >= dr) {
        return;
    }

    int idx = part(st,dr);
    if (k <= idx) {
        solve(st,idx,k);
    }
    else {
        solve (idx+1,dr,k);
    }
}

int part(int st,int dr) {
    int idx = rand()%(dr-st+1) + st;
    swap(v[st],v[idx]);

    int pivot = v[st];
    int i = st-1, j = dr+1;
    while (true) {
        do {
            ++i;
        }
        while (v[i] < pivot);

        do {
            --j;
        }
        while (v[j] > pivot);

        if (i < j) {
            swap(v[i],v[j]);
        }
        else {
            return j;
        }
    }
}