桶排的

#include<bits/stdc++.h>

using namespace std;

int map[30005];//bool
int tap[30005];//where

int main() {
	int n,k;
	int ci;
	cin >> n >> k;
	for (int i = 0; i < n; i++) {
		cin >> ci;
		tap[ci] = ci;
		map[ci] = 1;
	}
	int ans = 0;
	for (int i = 0; i <= 30000; i++) {
		if (ans == k) {
			cout << tap[ans];
			return 0;
		}
		else {
			ans++;
		}
	}
	cout << "NO RESULT";
	return 0;
}