#include<bits/stdc++.h> using namespace std; int n,a[10100],i,k,b; int main(){ cin>>n>>k; while(n--){ cin>>b; int flag=0; for(int j=1;j<=i;j++) if(a[j]==b) flag=1; if(!flag) a[++i]=b; } sort(a+1,a+i+1); if(k<=i) cout<<a[k]<<endl; else cout<<"NO RESULT"; return 0; }