#include <bits/stdc++.h>
using namespace std;
int n, a[200010], cnt, k;
int main() {
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a + 1, a + 1 + n);
	int a_size = unique(a + 1, a + 1 + n) - a;
	if (k < a_size)cout << a[k];
	else cout << "NO RESULT";
	return 0;
}