#include <stdio.h>
#include <algorithm>
using namespace std;
#define maxN    3000100

int N, K, v[maxN];
char s[maxN];

int main () {
    char *p;
    int i;

    freopen("sdo.in", "r", stdin);
    freopen("sdo.out", "w", stdout);

    scanf("%d%d\n", &N, &K);
    gets(s);

    for (p = s, i = 1; *p && i <= N; ++ i, ++ p)
        for (; *p >= '0' && *p <= '9'; ++ p)
            v[i] = (v[i] << 1) + (v[i] << 3) + *p - '0';

    nth_element(v + 1, v + K + 1, v + N + 1);
    printf("%d\n", v[K]);
}