#include <iostream>
#include <fstream>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <time.h>

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

#define ll long long
#define pb push_back
const int NMax = 3e6 + 5;
const int bits = 8;
const int nrBytes = 4;
const int Radix = 0b11111111;

// se sorteaza vectorul crescator cu Radix Sort si se afiseaza al k-lea element

int N,K;
int v1[NMax],v2[NMax];

void countingSort(int*,int*,int);

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

    for (int i=0;i < nrBytes;++i) {
        if (i & 1) {
            countingSort(v2,v1,i);
        }
        else {
            countingSort(v1,v2,i);
        }
    }

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

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

void countingSort(int* one,int* two,int byte) {
    int occ[(1<<bits) + 5] = {};

    for (int i=1;i <= N;++i) {
        ++occ[(one[i]>>(byte*bits)) & Radix];
    }

    int total = 0;
    for (int i=0;i <= Radix;++i) {
        int old = occ[i];
        occ[i] = total + 1;
        total += old;
    }

    for (int i=1;i <= N;++i) {
        two[ occ[(one[i]>>(byte*bits)) & Radix]++ ] = one[i];
    }
}