Diverse Team

题目描述： 给定n和k和n个元素的数列，请在这个数列中找k个不同的元素。 如果可行，则输出“YES”和其中一个答案（可能有多个答案）的元素编号。 否则输出“NO”。 输入格式： 第一行n和k，第二行n个数。 输出格式： 按照题目描述，若可行则输出“YES”和k个元素的编号，否则“NO”，不含引号。 感谢@南方不败 提供翻译

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.

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.

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

5 3
15 13 15 15 12

YES
1 2 5 

5 4
15 13 15 15 12

NO

4 4
20 10 40 30

YES
1 2 3 4 

All possible answers for the first example: - {1 2 5} - {2 3 5} - {2 4 5} Note that the order does not matter.