/***************************************************
 * Alex Palcuie
 * Romania - 2015
 * alex [dot] palcuie [at] gmail [dot] com
 * http://blog.palcu.ro/
****************************************************/

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

// Defines
#define NAME(n) #n
#define prv(v,n) dbv((v), (#v), (n))
#define prw(v) dbw((v), (#v))
#define F first 
#define S second 
#define pb push_back
#define sz size()
#define mp make_pair
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;

// Helpers
template <typename T> inline void dbv(const T * v, const char * name, int n){
    fprintf(stderr, "=== %s ===\n", name);
    for(int i=0; i<n; i++)
        cerr << v[i] << " ";
    cerr << '\n';
}
template<typename T> void dbw(const std::vector<T>& t, const char * name){
    fprintf(stderr, "=== %s ===\n", name);
    unsigned n = t.size();
    for(typename std::vector<T>::size_type i=0; i<n; ++i)
        std::cerr << t[i] << ' ';
    cerr << '\n';
}

// Structs

// Constants
const int N = 3000000;
const int INF = 0x3f3f3f3f;
int v[N];

// Globals

// Functions
int main(){
    ifstream fin("sdo.in");
    ofstream fout("sdo.out");
    
    int n, k;
    fin >> n >> k; k--;

    for (int i=0; i<n; i++)
        fin >> v[i];

    int lo = 0, hi = n-1;
    while (lo <= hi) {
        int pivot = hi;
        for (int i=lo; i<pivot; i++) {
            if (v[i] > v[pivot]) {
                swap(v[i], v[pivot]);
                swap(v[i], v[pivot-1]);
                pivot--;
                i--;
            }
        }
        if (pivot == k) {
            fout << v[pivot];
            break;
        } else if (pivot < k) {
            lo = pivot + 1;
        } else {
            hi = pivot - 1;
        }
    }
    
    return 0;
}