#include <bits/stdc++.h>

using namespace std;

void quick_sort(int v[], int st, int dr, int k){
    if(st>=dr){
        return;
    }
    int p1, p2;
    if(k<p1){
        quick_sort(v, st, p1-1, k);
    }
    if(k>p2){
        quick_sort(v, p2+1, dr, k);
    }


}


int main()
{
    ifstream in("sdo.in");
    ofstream out("sdo.out");
    int n, k;
    in >> n >> k;
    int v[n];
    k--;
    for(int i=0; i<n; i++){
        in>>v[i];
    }
    quick_sort(v,0,n-1,k);
    out << v[k]<<"\n";
    in.close();
    out.close();
    return 0;

}