#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
using namespace std;
int n,k,m,sum=1,ass[20001];
bool cmp(int a, int b)
{
	return a < b;
}
int max(int ass[])
{
	int max =0;
	for (int i = 1; i <= n; i++)
	{
		if (ass[i] > max)max = ass[i];
	}
	return max;
}
int main()
{
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
	{
		cin >> ass[i];
	}
	sort(ass + 1, ass + n + 1, cmp);
	m = max(ass);
	for (int i = 1; i < n; i++)
	{
		if (ass[i] == ass[i + 1])ass[i + 1] = m;
	}sort(ass + 1, ass + n + 1,cmp);
	for (int j = 1; j <= n; j++)
	{
		if (ass[j] !=m)sum++;
	}
	if (sum >= k)
		cout << ass[k] << endl;
	else cout << "NO RESULT" << endl;
	return 0;
}