#include <cstdio>
#include <algorithm>
using namespace std;

int main() {
    int n, k;
    scanf("%d %d", &n, &k);
    
    int nums[n];
    for (int i = 0; i < n; i++) {
        scanf("%d", &nums[i]);
    }
    
    sort(nums, nums + n);
    
    if (k <= n) {
        printf("%d\n", nums[k - 1]);
    } else {
        printf("NO RESULT\n");
    }
    
    return 0;
}