#include <iostream>
#include <fstream>

using namespace std;

#define MaxN 3000000

int v[MaxN];

void qsort(int st, int dr) {
    int p=v[st+rand()%(dr-st+1)];
    int b=st, e=dr;
    while(v[b]<p)
        b++;
    while(v[e]>p)
        e--;

    while(b<e) {
        swap(v[b], v[e]); b++; e--;
        while(v[b]<p) b++;
        while(v[e]>p) e--;
    }

    if(e>st)
    {
      qsort(st, e);
    }
    if(e+1<dr)
    {
      qsort(e+1, dr);
    }
}
int main()
{
    ifstream in("sdo.in");
    ofstream out("sdo.out");

    int n, i, k;
    in>>n>>k;
    for(i=0; i<n; i++)
        in>>v[i];

    qsort(0, n-1);
    out<<v[k-1];
    return 0;
}