cf A. Diverse Team

A. Diverse Team

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard 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$.

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.

题解：

#include <cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<set>
using namespace std;
/*从第一个开始往下取数，第一个数进入set中，
  然后往后取数，与set中比较，有不同则进入，同时用cnt记录下标和个数。
  一旦取到最后一个数或者取到足够数。则结束*/




int main()
{
    int num[200];
    set<int >dict;
    int ans[200];
    int cnt=1;//记录不同数个数
    int n,k;
    cin>>n>>k;
    for(int i=0; i<n; i++)
        cin>>num[i];


    /**/
    ans[0]=1;
    dict.insert(num[0]);
    for(int i=1; i<n; i++){
        if(cnt>=k){
            break;
        }
        if(!dict.count(num[i])){
            dict.insert(num[i]);
            ans[cnt++]=i+1;
        }
    }
    if(cnt>=k){
        cout<<"YES"<<endl;
        for(int i=0; i<cnt; i++)
            cout<<ans[i]<<" ";
    }
    else
        cout<<"NO";




    return 0;
}