A - Diverse Team

Problem description

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≤k≤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≤k≤n≤100) — the number of students and the size of the team you have to form.The second line contains n integers a1,a2,…,an (1≤ai≤100), where ai 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

5 3
15 13 15 15 12

Output

YES
1 2 5 

Input

5 4
15 13 15 15 12

Output

NO

Input

4 4
20 10 40 30

Output

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个学生中找出k个不同的数字，如果有输出"YES"，并且依次输出他们的序号，否则输出"NO"，简单水过！

AC代码：

 #include<bits/stdc++.h>
 using namespace std;
 int main(){
     int n,k,x,m=,a[],b[];bool flag;//a数组存放不重复的元素，b数组记录每个元素的位置
     cin>>n>>k;
     for(int i=;i<=n;++i){
         cin>>x;flag=false;
         for(int j=;j<m;++j)
             if(a[j]==x){flag=true;break;}
         if(!flag){b[m]=i;a[m++]=x;}
     }
     if(m>=k){
         cout<<"YES"<<endl;
         for(int i=;i<k;++i)
             cout<<b[i]<<(i==k-?"\n":" ");
     }
     else cout<<"NO"<<endl;
     return ;
 }