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

Difficulty: introductory

Starter code:

Solutions:
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
uniq = []
seen = set()
for i, x in enumerate(a):
    if x not in seen:
        seen.add(x)
        uniq.append((i + 1, x))

if len(uniq) < k:
    print('NO')
else:
    print('YES')
    b = [str(i) for i, _ in uniq[:k]]
    print(' '.join(b))


n, k = map(int, input().split())

arr = [int(x) for x in input().split()]
if len(set(arr)) < k:
    print('NO')
else:
    print('YES')
    s = set()
    for i, e in enumerate(arr):
        if k and e not in s:
            print(i + 1, end = ' ')
            k -= 1
            s.add(e)

n,k=map(int,input().split())
x=[*map(int,input().split())]
dad=dict()
a=[]
c=0
for n,i in enumerate(x):
  if dad.get(i,0)==0:
    a.append(n+1)
    c+=1
  if c==k: break
  dad[i]=1
if c<k: print('NO')
else:
  print('YES')
  for i in a: print(i,end=' ')

n,k=map(int,input().split())
ar=list(map(int,input().split()))
s=set()
for x in ar:
    s.add(x)
if(len(s)>=k):
    print("YES")
    e=set()
    a=[]
    i=0
    for x in ar:
        i+=1
        if(x not in e):
            a.append(i)
        e.add(x)
    print(*a[:k])
else:
    print("NO")

n, k = map(int, input().split())
a = list(map(int, input().split()))
rec1, rec2 = [], []
num = 0
for i in range(n):
    if num == k:
        break
    if a[i] not in rec1:
        rec1.append(a[i])
        rec2.append(i + 1)
        num += 1

if num >= k:
    print("YES")
    print(" ".join(map(str, rec2)))
else:
    print("NO")

n, k = map(int, input().split())
a = list(map(int, input().split()))
b = [0] * 101
q = 0
ans = []
for i in range(n):
    if b[a[i]] == 0:
        b[a[i]] = 1
        q += 1
        if (q <= k):
            ans.append(i + 1)
if q >= k:
    print("YES") 
    print(*ans)
else:
    print("NO")

def go():
    n, k = (int(i) for i in input().split(' '))
    s = [int(i) for i in input().split(' ')]
    c = 0
    so_far = set()
    o = []
    for i in range(n):
        if c == k:
            break
        if s[i] not in so_far:
            so_far.add(s[i])
            o.append(i)
            c += 1
    if c == k:
        print('YES')
        print(' '.join(str(i + 1) for i in o).strip())
    else:
        print('NO')

go()


a = [int(x) for x in input().strip().split(" ")]

N = a[0]
n = a[1]

l = [int(x) for x in input().strip().split(" ")]
assert len(l) == N

d = {}

for (i, e) in enumerate(l):
    if e not in d:
        d[e] = i + 1


if len(d) >= n:
    print("YES")
    for e in list(d.values())[:n]:
        print(e, end = " ")
else:
    print("NO")


from copy import deepcopy
import itertools
from bisect import bisect_left
import math


def read():
    return int(input())


def readmap():
    return map(int, input().split())


def readlist():
    return list(map(int, input().split()))


N, K = readmap()
A = readlist()

idx = []

for i in range(N):
    if A[i] not in A[:i]:
        idx.append(i+1)
    if len(idx) == K:
        break

if len(idx) == K:
    print("YES")
    print(" ".join(list(map(str, idx))))
else:
    print("NO")

from math import log
n,k = map(int,input().split())
ai = list(map(int,input().split()))
s = set()
ai2 = []
for i in range(n):
    if ai[i] not in s:
        ai2 += [i+1]
    s.add(ai[i])
if len(s) >= k:
    print("YES")
    for i in range(k):
        print(ai2[i],end=" ")
else:
    print("NO")


n,k=list(map(int,input().split()))
s=list(map(int,input().split()))
a=set()
x=0
sol=[]
for i in range(n):
    if s[i] not in a and x<k:
        a.add(s[i])
        x+=1
        sol.append(i+1)
    if x==k:
        break
if x==k:
    print("YES")
    for i in sol:
        print(i,end=" ")
else:
    print("NO")
        


n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
v = set()
ans = []
for i in range(len(a)):
	if a[i] not in v:
		v.add(a[i])
		ans.append(i + 1)
	if len(ans) == k:
		break
if len(ans) == k:
	print('YES')
	print(' '.join(map(str, ans)))
else:
	print('NO')


n,k=map(int,input().split())
arr=list(map(int,input().split()))
arr1=[]
arr2=[]
for i in range(n):
    if(arr[i] not in arr1):
        arr1.append(arr[i])
        arr2.append(i+1)
if(len(arr1)<k):
    print("NO")
else:
    print("YES")
    print(*arr2[:k])