#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <deque>
#include <algorithm>
#define ll long long

using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,i,j,k,nr,v[3000005],sol;

int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++) f>>v[i];
    sort(v+1,v+n+1);
    v[0]=-1;
    for(i=1;i<=n;i++)
    {
        if(v[i]!=v[i-1]) nr++;
        if(nr==k)
        {
            sol=v[i];
            break;
        }
    }
    g<<sol<<'\n';
    return 0;
}