#include <cstdio>
#include<algorithm>
#include<iostream>
using namespace std;

const int N = 1000010;
 int n,k;
int quick_sort(int q[], int l, int r)
{
    if (l == r) 
        return q[l];

    int i = l-1, j = r+1 ;
    int x=q[l];
    while (i < j)
    {
        while (q[++i] < x );
        while (q[--j] > x );
        if (i < j) 
            swap(q[i], q[j]);
    }
    if(j>=k)
        quick_sort(q, l, j);
    else
        quick_sort(q, j + 1, r);
}

int main()
{
    int q[N];
    scanf("%d%d", &n,&k);
    k--;//与下标对应
    for (int i = 0; i < n; i ++ ) scanf("%d", &q[i]);
   cout<< quick_sort(q, 0, n - 1);
    return 0;
}