#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;

int main()
{
    ifstream f("sdo.in");
    ofstream g("sdo.out");
    vector <int> v;
    int n, k;
    f>>n>>k;
    for (int i=1; i<=n; i++)
    {
        int p;
        f>>p;
        v.push_back(p);
    }
    sort(v.begin(), v.end());
    g<<v[k-1];
    return 0;
}