#include <cstdio>
#include <algorithm>
#define NMAX 300001
using namespace std;

int n,k;
struct vect{
    int val, ind;

}V[NMAX];

bool order(const vect A, const vect B){

    if(A.val == B.val)
        return A.ind < B.ind;
return A.val < B.val;
}

int main(){

    freopen("sdo.in","r",stdin);
    freopen("sdo.out","w",stdout);
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++){
    scanf("%d",&V[i].val);
    V[i].ind = i;
    }
    sort(V+1,V+1+n,order);
    printf("%d",V[k].val);

return 0;
}