#include <algorithm>
#include <iostream>
#include <string>
#include <set>
using namespace std;
int main() {
    int n, k;
    cin >> n >> k;
    int a[n];
    set<int> s;
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        s.insert(a[i]);
    }
    if(k > s.size()) {
        cout << "NO RESULT";
        return 0;
    }
    set<int>:: iterator it;
    it = s.begin();
    int t = 1;
    while(t < k) {
        it++;
        t++;
    }
    cout << *it;
    return 0;
}