#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string>
#include <stdlib.h>
#include <assert.h>
#include <time.h>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <queue>
#include<cstdlib>
using namespace std;
	
#define MAXN 3000005
//#define radical3 1.7320508075
//#define MAXDIFF	2000000000
//#define PI  3.141592653
//double eps = 1e-3;

int n, k, v[MAXN];
void RadixSort(int *v, int n)
{
	int nr[11], bucket[MAXN], max = v[0];
	for (int  i = 1; i < n; i++)
	{
		if ( max < v[i] )
			max = v[i];
	}
	int exp = 1;
	while (max / exp > 0)
	{
		for (int i = 0; i < 10; i++)
		{
			nr[i] = 0;
		}
		for (int i = 0; i < n; i++)
		{
			nr[( v[i] / exp ) % 10]++;
		}
		for (int i = 1; i < 10; i++)
		{
			nr[i] += nr[i-1];
		}
		for (int i = n-1; i >= 0; i--)
		{
			bucket[--nr[(v[i] / exp) % 10]] = v[i];
		}
		for (int i = 0; i < n; i++)
		{
			v[i] = bucket[i];
		}
		exp *= 10;
	}
}

int main()
{
	
	FILE *f = fopen("sdo.in", "r");
	FILE *g = fopen("sdo.out", "w");
	
	fscanf(f, "%d %d", &n, &k);
	for (int i = 0; i < n; i++)
	{
		fscanf(f, "%d", &v[i]);
	}
	RadixSort(v, n);
	fprintf(g, "%d", v[k-1]);
	fclose(f); fclose(g);
	return 0;
}