#include <iostream>
using namespace std;

void sorty(int *a, int d) {
	for (int i = 1; i <= d - 1; i++) {

		int now = a[i], j;

		for (j = i - 1; j >= 0 && a[j] > now; j--)

			a[j + 1] = a[j];
		a[j + 1] = now;
	}
}

int main() {
	int a[10000], k, n;
	cin >> n >> k;

	for (int i = 0; i <= n - 1; i++)

		cin >> a[i];
	sorty(a, n);
	int last = 30001, i;
	k--;

	for (i = 0;k >= 0; i++) {

		if (a[i] != last)
			k--;
		last = a[i];
	}

	if (i > n)
		cout << "NO RESULT";
	else
		cout << a[i];
	return 0;
}