//%一發大佬的程式碼，是真的漂亮
#include<bits/stdc++.h>
using namespace std;
int n,k,i,x;
map<int,int> p;
int main(){
	for(cin>>n>>k,i=1;i<=n;i++)cin>>x,p[x]=i;
	if(p.size()<k)return cout<<"NO",0;
	cout<<"YES"<<endl;
	i=0;
	for(auto s:p)if(i++<k)cout<<s.second<<" ";
}
 

A. Diverse Teamtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output

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$

.

ExamplesInputCopy

5 3
15 13 15 15 12

OutputCopy

YES
1 2 5 

InputCopy

5 4
15 13 15 15 12

OutputCopy

NO

InputCopy

4 4
20 10 40 30

OutputCopy

YES
1 2 3 4