#include<bits/stdc++.h>
using namespace std;
const int maxn=10005;
int n,k,cnt,A[maxn];
int read(){
	int ret=0,f=1;char ch=getchar();
	while (!isdigit(ch)) {if (ch=='-')f=-f;ch=getchar();}
	while ( isdigit(ch)) ret=(ret<<3)+(ret<<1)+(ch&15),ch=getchar();
	return ret*f;
}
int main(){
	n=read(),k=read();
	for (int i=1;i<=n;i++) A[i]=read();
	sort(A+1,A+1+n);
        for (int i=1;i<=n;i++) 
	  if (A[i]!=A[i-1]) A[++cnt]=A[i];
	if (cnt>=k) printf("%d\n",A[k]);else printf("No result\n");
	return 0;
}