Diverse Team（暴力）

There are $n$ students in a school class, the rating of the $i$-th student on Codehorses is $a_i$. You have to form a team consisting of $k$ students ( $1\le k\le n$

) such that the ratings of all team members are distinct.

If it is impossible to form a suitable team, print "NO" (without quotes). Otherwise print "YES", and then print $k$

distinct numbers which should be the indices of students in the team you form. If there are multiple answers, print any of them.

Input

The first line contains two integers $n$

and $k$ ( $1\le k\le n\le 100$

) — the number of students and the size of the team you have to form.

The second line contains $n$

integers $a_1,a_2,\dots ,a_n$ ( $1\le a_i\le 100$), where $a_i$ is the rating of $i$

-th student.

Output

If it is impossible to form a suitable team, print "NO" (without quotes). Otherwise print "YES", and then print $k$

distinct integers from $1$ to $n$

which should be the indices of students in the team you form. All the ratings of the students in the team should be distinct. You may print the indices in any order. If there are multiple answers, print any of them.

Assume that the students are numbered from $1$

to $n$

.

Examples

Input

Copy

5 3
15 13 15 15 12

Output

Copy

YES
1 2 5 

Input

Copy

5 4
15 13 15 15 12

Output

Copy

NO

Input

Copy

4 4
20 10 40 30

Output

Copy

YES
1 2 3 4 

Note

All possible answers for the first example:

• {1 2 5}
• {2 3 5}
• {2 4 5}

Note that the order does not matter.

题意：一共给n个数，在n个数里找k个完全不相同的数，如果能找到，可以输出任意一组的下标，如果不能输出NO

思路：定义一个vis数组记录每个数字出现的下标，如果是0表示没有出现过，用type记录数字的种类，如果小于k则直接输出NO

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 105;
int vis[N];
int main(){
	int n,k;
	scanf("%d%d",&n,&k);
	int type=0;
	for(int i=0;i<n;i++){
		int x;
		scanf("%d",&x);
		if(!vis[x]){
			vis[x]=i+1;
			type++;
		}
	}
	if(type<k) printf("NO\n");
	else{
		printf("YES\n");
		int j=0;
		sort(vis,vis+101);
		for(int i=0;i<=100;i++)
		  if(vis[i]){
		  	if(k==1) printf("%d\n",vis[i]);
		  	else if(k>1) printf("%d ",vis[i]);
		  	else break;
		  	k--;
		  }
	}
	return 0;
}