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 a_1, a_2, ..., a_n (1 ≤ a_i ≤ 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

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.
#DECLARING VARIABLES
memberNow=0         #SHOWING HOW MANY MEMBER IS IN THE TEAM NOW
sameRank=False      #BOOLEAN TO SHOW IF THE RANK IS IN THE TEAM OR NOT
teamMember=[]       #THE NUMBER OF THE STUDENTS IN THE TEAM
#INPUT TOTAL STUDENTS AND NUMBER OF STUDENT(S) IN A TEAM
studentNum, teamCons = map(int, input().split())
#INPUT ALL STUDENTS RANK
allRanks = [int(x) for x in input().split()]
#CHECK ALL OF THE STUDENT RANKS
for i in range(studentNum):
    #THE FIRST ONE IS ALWAYS HAVE DIFFERENT RANK BECAUSE, THERE IS NO ONE IN THE TEAM
    if (i==0):
        #ADD THE STUDENT NUMBER TO ARRAY AND TEAM MEMBER
        teamMember.append(i+1)
        memberNow=memberNow+1
    else:
        #IF THE REQUIRED STUDENT(S) IN THE TEAM IS REACHED
        if (memberNow==teamCons):
            break
        #CHECK WHETHER THE RANK IS THE SAME WITH THE OTHERS
        for j in range(i):
            if (allRanks[i]==allRanks[j]):
                sameRank=True
                break
        #IF THE RANK IS DIFFERENT FROM THE REST OF THE TEAM
        if (sameRank==False):
            #ADD THE STUDENT NUMBER TO ARRAY AND TEAM MEMBER
            teamMember.append(i+1)
            memberNow=memberNow+1
        #IF IT IS THE SAME, RESET sameRank TO FALSE
        else:
            sameRank=False
#IF THE MEMBER REACH THE REQUIRED OF EACH TEAM
if (memberNow>=teamCons):
    print("YES")
    print(" ".join(str(student) for student in teamMember))
#OTHERWISE "NO"
else:
    print("NO")