#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");

#define ll long long
#define pb push_back
const int NMax = 3e6 + 5;

int N,K,nrHeap;
int arr[NMax],heap[NMax];

void siftFirst(int,int);
void siftSecond(int,int);
void percolate(int);

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

    for (int i=N/2;i > 0;--i) {
        siftFirst(i,N);
    }

    /*
    for (int j=1;j <= N;++j) {
        cout<<arr[j]<<' ';
    }
    cout<<"\n\n";
    //*/

    heap[++nrHeap] = 1;
    for (int c=1;c < K;++c) {
        int node = heap[1];

        swap(heap[1],heap[nrHeap]);
        --nrHeap;
        siftSecond(1,nrHeap);

        int fs = node*2,ss = fs+1;
        if (fs <= N) {
            heap[++nrHeap] = fs;
            percolate(nrHeap);
        }
        if (ss <= N) {
            heap[++nrHeap] = ss;
            percolate(nrHeap);
        }
    }

    out<<arr[heap[1]]<<'\n';

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

void siftFirst(int node,int dim) {

    int son = 0;
    do {
        son = 0;
        int fs = node*2,
            ss = node*2 + 1;
        if (fs <= dim) {
            son = fs;
            if (ss <= dim && arr[ss] < arr[son]) {
                son = ss;
            }
        }

        if (son && arr[son] < arr[node]) {
            swap(arr[node],arr[son]);
            node = son;
        }
        else {
            son = 0;
        }
    }
    while (son);
}

void siftSecond(int node,int dim) {

    int son = 0;
    do {
        son = 0;
        int fs = node*2,
            ss = node*2 + 1;
        if (fs <= dim) {
            son = fs;
            if (ss <= dim && arr[heap[ss]] < arr[heap[son]]) {
                son = ss;
            }
        }

        if (son && arr[heap[son]] < arr[heap[node]]) {
            swap(heap[node],heap[son]);
            node = son;
        }
        else {
            son = 0;
        }
    }
    while (son);
}

void percolate(int node) {

    int dad = node/2;
    while (node != 1 && arr[heap[node]] < arr[heap[dad]]) {
        swap(heap[node],heap[dad]);
        node = dad;

        dad = node/2;
    }
}