#include<bits/stdc++.h>
using namespace std;
int A[10005],b[10005]; 
void Sort(int L,int R){
	int key=A[L],i=L,j=R;
	while(i<j){
		while(i<j&&key<=A[j])j--;
		if(i<j)A[i]=A[j];
		while(i<j&&key>=A[i])i++;
		if(i<j)A[j]=A[i];
	}
	A[i]=key;
	if(i-1>L)Sort(L,i-1);
	if(i+1<R)Sort(i+1,R);
}
int main(){
	int n,k;
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		scanf("%d",&A[i]);
	}
	if(k>n){
		cout<<"NO RESULT";
		return 0;
	}
	Sort(1,n);
	for(int i=2;i<=n;i++){
		if(A[i]==A[i-1]){
		A[i]=0;
		}
	}
	int j=1;
	for(int i=1;i<=n;i++){
		if(A[i]!=0){
			b[j]=A[i];
			cout<<b[j]<<" ";
			j++;
		}
	}
	if(j<k){
		cout<<"NO RESULT";
		return 0;
	}
	cout<<b[k];
	return 0;
}