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: EASY

Solutions:
N = list(map(int, input().split()))
T = list(map(int, input().split()))
TEAM = []
INDEX = []
for _ in range(N[0]):
	if T[_] not in TEAM:
		TEAM.append(T[_])
		INDEX.append(_ + 1)
	if len(TEAM) == N[1]:
		print('YES')
		print(*INDEX)
		exit()
print('NO')


(n, k) = input().split()
(n, k) = [int(n), int(k)]
a = [int(i) for i in input().split()]
c = 0
b = []
for i in range(0, n):
	if a[i] != 0:
		for j in range(i + 1, n):
			if a[i] == a[j]:
				a[j] = 0
		b.append(i + 1)
		c += 1
if c < k:
	print('NO')
else:
	print('YES')
	print(*b[:k], sep=' ')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
selected = []
indices = []
for i in range(n):
	if a[i] not in selected:
		selected.append(a[i])
		indices.append(i + 1)
if len(indices) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(indices[i], end=' ')


(n, k) = (int(x) for x in input().split())
students = list(map(int, input().split()))
team_index = []
team = []
for i in range(len(students)):
	if not students[i] in team:
		team.append(students[i])
		team_index.append(i + 1)
if len(team) >= k:
	print('YES')
	print(' '.join(map(str, team_index[:k])))
else:
	print('NO')


(n, m) = map(int, input().split())
l = list(map(int, input().split()))
(x, y) = ([], [])
l1 = list(set(l))
if len(l1) < m:
	print('NO')
else:
	for i in range(len(l1)):
		if l1[i] in l:
			x.append(l.index(l1[i]))
	for i in range(len(x)):
		x[i] = x[i] + 1
	print('YES')
	x.sort()
	for i in range(m):
		y.append(x[i])
	print(*y)


(n, k) = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
b = []
c = []
for i in range(n):
	if a[i] not in b:
		b.append(a[i])
		c.append(i + 1)
	if len(c) == k:
		break
if len(c) >= k:
	print('YES')
	print(*c)
else:
	print('NO')


q = input()
(n, k) = q.split()
n = int(n)
k = int(k)
s2 = []
s1 = [0]
p = 0
s = input().split()
for i in range(n):
	if s[i] in s1:
		p += 1
	else:
		s1.append(s[i])
		s2.append(i + 1)
if k <= len(s2):
	print('YES')
	for i in range(k):
		print(s2[i], end=' ')
else:
	print('NO')


(x, n) = map(int, input().split())
l = list(map(int, input().split()))
k = []
g = []
for i in l:
	if (i in k) == False:
		k.append(i)
if len(k) < n:
	print('NO')
else:
	print('YES')
	for i in range(n):
		print(l.index(k[i]) + 1, end=' ')


(a, b) = input().split()
(a, b) = (int(a), int(b))
c = []
k = 0
g = input().split()
for i in range(a):
	if g[i] not in c:
		k += 1
		c.append(g[i])
if k >= b:
	print('YES')
	for i in range(b):
		print(g.index(c[i]) + 1, 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')


(n, k) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
b = list(dict.fromkeys(a))
if len(b) >= k:
	res = ''
	for i in range(k):
		res += str(a.index(b[i]) + 1) + ' '
	res = res[:len(res) - 1]
	print('YES')
	print(res)
else:
	print('NO')


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')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
d = dict()
for i in range(n):
	if a[i] not in d:
		d[a[i]] = i + 1
if len(d) < k:
	print('NO')
else:
	print('YES')
	c = 0
	for i in d:
		print(d[i], end=' ')
		c += 1
		if c >= k:
			break


l = []
c = 0
ns = ''
a = input().split()
s = input().split()
for i in range(int(a[0])):
	if s[i] not in l:
		l.append(s[i])
		ns += str(i + 1) + ' '
		c += 1
	if c == int(a[1]):
		print('YES')
		print(ns)
		break
if c != int(a[1]):
	print('NO')


class unique:

	def __init__(self):
		self.arr = []

	def ppush(self, num):
		if num in self.arr:
			nothing = 0
		else:
			self.arr.append(num)

	def getL(self):
		return len(self.arr)

	def getArr(self):
		return self.arr
in1 = input().split(' ')
members = int(in1[0])
size = int(in1[1])
uarr = unique()
score = input().split(' ')
for i in range(len(score)):
	uarr.ppush(score[i])
if uarr.getL() < size:
	print('NO')
else:
	print('YES')
	re = ''
	uuar = uarr.getArr()
	for i in range(size):
		re += str(score.index(uuar[i]) + 1)
		re += ' '
	print(re)


(n, k) = map(int, input().split())
a = [int(a) for a in input().split()]
b = list()
for i in a:
	if i not in b:
		b.append(i)
if len(b) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(a.index(b[i]) + 1, end=' ')


(k, n) = list(map(int, input().split()))
st = list(map(int, input().split()))
a = [0] * 101
ct = 0
for i in range(k):
	if a[st[i]] == 0:
		ct += 1
	a[st[i]] += 1
if ct < n:
	print('NO')
else:
	print('YES')
	i = 0
	while n > 0:
		if a[st[i]] != 0:
			a[st[i]] = 0
			print(i + 1, end=' ')
			n -= 1
		i += 1
	print()


(n, k) = str(input()).split()
n = int(n)
k = int(k)
st = str(input()).split()
st = [int(i) for i in st]
s = set()
a = []
for i in range(0, n):
	if st[i] not in s:
		s.add(st[i])
		a += [i]
if len(s) < k:
	print('NO')
	exit(0)
print('YES')
res = ''
for i in range(0, k - 1):
	res += str(a[i] + 1) + ' '
res += str(a[k - 1] + 1)
print(res)


(n, k) = map(int, input().split())
mass = list(map(int, input().split()))
if len(set(mass)) < k:
	print('NO')
else:
	print('YES')
	a = 0
	for i in range(len(mass)):
		if mass[i] not in mass[:i]:
			print(i + 1, end=' ')
			a += 1
		if a == k:
			break


(n, k) = map(int, input().split())
arr = list(map(int, input().split()))
m = {}
d = []
c = 0
for i in range(n):
	if arr[i] in m:
		c += 1
	else:
		m[arr[i]] = 1
		d.append(i + 1)
if len(m) >= k:
	print('YES')
	print(*d[:k])
else:
	print('NO')


(n, k) = map(int, input().split())
b = list(map(int, input().split()))
d = []
for i in b:
	if i not in d:
		d.append(i)
if len(d) >= k:
	print('YES')
	o = []
	for i in range(0, k):
		o.append(str(b.index(d[i]) + 1))
	print(' '.join(o))
else:
	print('NO')


from collections import defaultdict
(n, k) = map(int, input().split())
arr = [int(j) for j in input().split()]
d = defaultdict(list)
for x in range(n):
	d[arr[x]] += [x]
ans = []
for x in d:
	ans += [d[x][0] + 1]
if len(ans) < k:
	print('NO')
else:
	print('YES')
	print(*ans[:k])


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
ans = []
for i in set(l):
	ind = l.index(i)
	ans.append(ind + 1)
ans.sort()
for i in range(len(ans)):
	ans[i] = str(ans[i])
if len(set(l)) >= k:
	print('YES')
	print(' '.join(ans[:k]))
else:
	print('NO')


(n, k) = map(int, input().split())
c = list(map(int, input().split()))
visited = []
w = []
for i in range(len(c)):
	if c[i] not in visited:
		visited.append(c[i])
		w.append(i + 1)
if len(visited) >= k:
	print('YES')
	print(*w[:k])
else:
	print('NO')


mp = {}
[n, k] = map(int, input().split())
count = 0
arr = [int(i) for i in input().split()]
for i in range(n):
	if arr[i] not in mp:
		mp[arr[i]] = i
		count += 1
	if count == k:
		break
if count != k:
	print('NO')
else:
	print('YES')
	for i in mp.values():
		print(i + 1, end=' ')


(a, b) = map(int, input().split())
array = list(map(int, input().split()))
output = []
index = []
for x in range(a):
	if array[x] not in output:
		output.append(array[x])
		index.append(x)
if len(index) >= b:
	print('YES')
	for i in range(b):
		print('%d ' % (index[i] + 1), end='')
else:
	print('NO', end='')


(n, k) = map(int, input().split())
array = tuple(map(int, input().split()))
s = set()
ans = 0
new_list = list()
for i in range(n):
	if array[i] not in s:
		s.add(array[i])
		new_list.append(i + 1)
		ans += 1
		if ans == k:
			print('YES')
			print(*new_list)
			break
else:
	print('NO')


def countDistinct(l):
	k = []
	for i in range(len(l)):
		if l[i] not in k:
			k.append(l[i])
	return k
(n, k) = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
j = countDistinct(l)
if len(j) >= k:
	print('YES')
	for i in range(k):
		print(l.index(j[i]) + 1, end=' ')
else:
	print('NO')


(n, k) = list(map(int, input().split()))
a = list(map(int, input().split()))
b = set(a)
l = len(b)
if l >= k:
	print('YES')
	c = set()
	i = 0
	p = 0
	while i < n:
		if a[i] in c:
			i += 1
			continue
		else:
			c.add(a[i])
			print(i + 1, end=' ')
			i += 1
			p += 1
		if p == k:
			break
else:
	print('NO')


import sys
tmp1 = sys.stdin.readline()
mytmp1 = tmp1.split()
num_student = int(mytmp1[0])
size_team = int(mytmp1[1])
tmp2 = sys.stdin.readline()
mytmp2 = tmp2.split()
rank = [int(c) for c in mytmp2]
count = 0
result_rank = []
result_ind = []
ind = 0
flag = True
while count < size_team:
	for i in range(ind, num_student):
		if rank[i] not in result_rank:
			result_rank.append(rank[i])
			result_ind.append(i + 1)
			ind = i + 1
			count += 1
			break
	if i == num_student - 1 and count < size_team:
		flag = False
		break
if flag:
	sys.stdout.write('YES' + '\n')
	for ind in result_ind:
		sys.stdout.write(str(ind) + ' ')
else:
	sys.stdout.write('NO')


import sys
lines = sys.stdin.readlines()
cur_line = -1

def input():
	global lines, cur_line
	cur_line += 1
	return lines[cur_line][:-1]
(n, k) = map(int, input().split())
used = {}
res = []
stud = list(map(int, input().split()))
for _ in range(n):
	a = stud[_]
	if a in used:
		continue
	used[a] = 1
	res.append(_ + 1)
if len(res) < k:
	print('NO')
else:
	print('YES')
	print(*res[:k])


(n, k) = [int(x) for x in input().split()]
a = list(map(int, input().split()))
l = []
s = []
for i in range(n):
	if a[i] not in l:
		l.append(a[i])
		s.append(i + 1)
if len(l) >= k:
	print('YES')
	for i in range(k):
		print(s[i], end=' ')
else:
	print('NO')


lst = list(map(int, input().split()))
res = ''
s = list(map(int, input().split()))
l1 = list()
l2 = list()
for a in range(len(s)):
	if s[a] not in l1:
		l1.append(s[a])
		l2.append(a)
if len(l1) >= lst[1]:
	print('YES')
	for a in range(lst[1]):
		res += str(l2[a] + 1) + ' '
	print(res)
else:
	print('NO')


(a, b) = map(int, input().split())
lst = map(int, input().split())
dis_val = []
indices = []
counter = 1
for i in lst:
	if i not in dis_val:
		dis_val.append(i)
		indices.append(counter)
	if len(dis_val) == b:
		break
	counter += 1
if len(dis_val) >= b:
	print('YES')
	print(*indices)
else:
	print('NO')


(n, k) = input().split(' ')
n = int(n)
k = int(k)
scholars = input()
if len(set(scholars.split(' '))) < k:
	print('NO')
else:
	print('YES')
	temp = list()
	scholars = scholars.split(' ')
	for i in range(len(scholars)):
		if len(temp) == k:
			break
		if not scholars[i] in temp:
			print(i + 1, end=' ')
			temp.append(scholars[i])


f = lambda : map(int, input().split())
(n, k) = f()
(l, lt) = (list(f()), [])
for i in l:
	if not i in lt:
		lt.append(i)
print('YNEOS'[len(lt) < k::2])
if len(lt) >= k:
	for i in range(k):
		print(l.index(lt[i]) + 1, end=' ')


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
p = []
q = []
if len(set(l)) >= k:
	print('YES')
	for i in range(n):
		if l[i] not in p:
			q.append(i + 1)
			p.append(l[i])
	print(*q[:k], sep=' ')
else:
	print('NO')


(n, k) = map(int, input().split(' '))
inp = list(map(int, input().split()))
distinct = dict()
index = 0
for i in inp:
	index += 1
	if i not in distinct:
		distinct[i] = index
if len(distinct) < k:
	print('NO')
else:
	print('YES')
	for i in distinct.values():
		if k == 0:
			break
		k -= 1
		print(i, end=' ')


import argparse

def main():
	(n, k) = [int(i) for i in input().split()]
	arr = [int(i) for i in input().split()]
	ans = []
	ans2 = []
	for i in range(n):
		if arr[i] not in ans2:
			ans.append(i + 1)
			ans2.append(arr[i])
	if len(ans) < k:
		print('NO')
	else:
		print('YES')
		for i in range(k):
			print(ans[i], end=' ')
main()


s = input()
(n, k) = s.split()
a = input()
team = {a: b for (a, b) in zip(range(1, int(n) + 1), a.split())}
a = set(a.split())
ans = []
ans2 = []
if len(a) >= int(k):
	for (x, y) in team.items():
		if len(ans2) == int(k):
			break
		elif y in a and y not in ans:
			ans2.append(str(x))
			ans.append(y)
		else:
			pass
	print('YES')
	print(' '.join(ans2))
else:
	print('NO')


(n, k) = map(int, input().split())
d = {}
l = list(map(int, input().split()))
for i in range(n):
	if l[i] not in d:
		d[l[i]] = i + 1
val = list(sorted(d.values()))
if len(d) >= k:
	print('YES')
	print(*val[:k])
else:
	print('NO')


(n, k) = map(int, input().split())
ar = list(map(int, input().split()))
ar1 = []
count = 0
for i in range(n):
	if ar[i] not in ar1:
		ar1.append(ar[i])
		if len(ar1) == k:
			break
if len(ar1) == k:
	print('YES')
	count = 1
else:
	print('NO')
if count == 1:
	for i in ar1:
		print(ar.index(i) + 1, end=' ')


(n, k) = map(int, input().split())
myList = list(map(int, input().split()))
myNewList = []
myNewList2 = []
for i in range(0, len(myList)):
	if len(myNewList) < k:
		if myList[i] in myNewList:
			i = i
		else:
			myNewList.append(myList[i])
			x = i + 1
			myNewList2.append(x)
if len(myNewList) == k:
	print('YES')
	print(*myNewList2)
else:
	print('NO')


(n, k) = map(int, input().split())
ratingArray = [int(x) for x in input().split()]
uniqueRating = []
index = []
for i in range(n):
	if ratingArray[i] not in uniqueRating:
		uniqueRating.append(ratingArray[i])
		index.append(i + 1)
if len(uniqueRating) >= k:
	print('YES')
	for i in range(k):
		print(index[i], end=' ')
else:
	print('NO')


s = input()
s = s.split()
a = int(s[0])
b = int(s[1])
s = input()
s = s.split()
for i in range(len(s)):
	s[i] = int(s[i])
markers = []
for number in s:
	if number in markers:
		continue
	else:
		markers += [number]
if len(markers) >= b:
	print('YES')
	for i in range(b):
		print(s.index(markers[i]) + 1, end=' ')
else:
	print('NO')


(n, k) = input().split()
n = int(n)
k = int(k)
a = []
s = input().split()
for i in s:
	a.append(int(i))
b = []
ind = []
for i in range(n):
	if a[i] not in b:
		b.append(a[i])
		ind.append(i + 1)
if len(b) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(ind[i], end=' ')
	print()


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
b = []
c = []
for i in range(n):
	if a[i] not in b and len(b) != k:
		b.append(a[i])
		c.append(i + 1)
if len(b) == k:
	print('YES')
	print(*c)
else:
	print('NO')


(n, k) = map(int, input().strip().split())
l = [int(x) for x in input().strip().split()]
l2 = []
l3 = []
for i in range(len(l)):
	if l[i] not in l3:
		l2.append(i + 1)
		l3.append(l[i])
if len(l3) >= k:
	print('YES')
	for i in range(k):
		print(l2[i], end=' ')
else:
	print('NO')


inp = lambda a: map(int, a)
inp_list = lambda a: [int(x) for x in a]
(n, k) = inp(input().split())
a = inp_list(input().split())
s = set(a)
if len(s) >= k:
	print('YES')
	cnt = 0
	for i in range(n):
		if a[i] in s:
			cnt += 1
			s.remove(a[i])
			print(i + 1, end=' ')
		if cnt == k:
			break
else:
	print('NO')


nk = list(map(int, input().split()))
a = list(map(int, input().split()))
team = []
team_index = []
for i in range(nk[0]):
	if len(team) == nk[1]:
		break
	if a[i] not in team:
		team.append(a[i])
		team_index.append(i + 1)
if len(team_index) >= nk[1]:
	print('YES')
	print(*team_index)
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())
l = list(map(int, input().split()))
d = {}
for i in range(n):
	if l[i] not in d.keys():
		d[l[i]] = i + 1
if len(d) < k:
	print('NO')
else:
	print('YES')
	i = 0
	for p in d.keys():
		if i < k:
			print(d[p], end=' ')
			i += 1
		else:
			break


import sys
(n, m) = map(int, input().split())
lis = list(map(int, input().split()))
a = set()
arg = []
for i in range(n):
	l = len(a)
	a.add(lis[i])
	if len(a) == l + 1:
		arg.append(i + 1)
if len(arg) >= m:
	print('YES')
	for i in range(m):
		print(arg[i], end=' ')
else:
	print('NO')


(totalEstudantes, tamTime) = [int(i) for i in input().split()]
ratings = [int(i) for i in input().split()]
estudantes = []
aux = []
for i in range(len(ratings)):
	if ratings[i] not in aux:
		aux.append(ratings[i])
		estudantes.append(i + 1)
if len(estudantes) >= tamTime:
	print('YES')
	for i in range(tamTime):
		print(estudantes[i], end=' ')
else:
	print('NO')


(n, k) = list(map(int, input().split()))
a = list(map(int, input().split()))
res = []
pos = []
for i in range(n):
	if a[i] not in pos:
		pos.append(a[i])
		res.append(i + 1)
		k -= 1
	if k == 0:
		break
if k > 0:
	print('NO')
else:
	print('YES')
	for i in range(len(res)):
		print(res[i], end=' ')


(n, k) = map(int, input().split())
a = input().split()
result = []
cache = []
for i in range(0, n):
	ai = int(a[i])
	if ai not in cache and len(result) < k:
		cache.append(ai)
		result.append(i)
if len(result) >= k:
	print('YES')
	for i in result:
		print(i + 1, end=' ')
else:
	print('NO')


(n, m) = map(int, input().split())
pre = list(map(str, input().split()))
l = list(dict.fromkeys(pre))[0:m]
for i in range(len(l)):
	l[i] = str(pre.index(l[i]) + 1)
if len(dict.fromkeys(l)) >= m:
	print('YES')
	print(' '.join(l))
else:
	print('NO')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
x = set()
for i in range(n):
	x.add(a[i])
if len(x) >= k:
	print('YES')
	cnt = 0
	for i in range(n):
		if a[i] in x:
			x.remove(a[i])
			print(i + 1, end=' ')
			cnt += 1
			if cnt == k:
				break
else:
	print('NO')


(a, b) = map(int, input().split())
l = list(map(int, input().split()))
re = []
had = []
for i in range(len(l)):
	if l[i] not in had:
		had.append(l[i])
		re.append(i + 1)
if len(re) >= b:
	print('YES')
	print(' '.join(map(str, re[:b])))
else:
	print('NO')


asw = []

def app():
	(n, k) = map(int, input().split(' '))
	students = list(map(int, input().split(' ')))
	distincts_students = {}
	for (index, student) in enumerate(students):
		if not student in distincts_students:
			distincts_students[student] = index
		if len(distincts_students) >= k:
			print('YES')
			for key in distincts_students:
				print(distincts_students[key] + 1, end=' ')
			print()
			return
	print('NO')
	return
app()


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


(m, n) = map(int, input().split())
l = input().split()
x = []
y = []
z = 0
for i in range(m):
	if z == n:
		break
	if l[i] not in x:
		x.append(l[i])
		y.append(str(i + 1))
		z = len(y)
if len(y) == n:
	print('YES')
	print(' '.join(y))
else:
	print('NO')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
list1 = []
list2 = []
for i in range(len(a)):
	if a[i] not in list1:
		list1.append(a[i])
		list2.append([a[i], i + 1])
list3 = []
if k <= len(list2):
	for i in range(k):
		list3.append(list2[i][1])
if k > len(list2):
	print('NO')
else:
	print('YES')
	print(*list3)


import sys
ipt = input().split()
n = int(ipt.pop(0))
k = int(ipt.pop(0))
std_ratings = [int(i) for i in input().split()]
ratings = []
positions = []
for i in range(0, n):
	if std_ratings[i] not in ratings:
		ratings.append(std_ratings[i])
		positions.append(i + 1)
if len(positions) >= k:
	print('YES')
	print(' '.join(map(str, positions[0:k])), sep=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
L = list(map(int, input().split()))
r = 0
s = []
N = []
for i in L:
	if i not in s:
		s += [i]
		r += 1
		N += [L.index(i)]
if r >= k:
	print('YES')
	for i in range(k):
		print(N[i] + 1, end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
v = []
j = []
for i in range(n):
	if l[i] not in v:
		v.append(l[i])
		j.append(i)
		if len(j) == k:
			break
if len(j) == k:
	print('YES')
	b = [j + 1 for j in j]
	print(*b)
else:
	print('NO')


(n, k) = list(map(int, input().strip().split()))
values = list(map(int, input().strip().split()))
d = {}
res = []
for i in range(n):
	if values[i] not in d:
		res.append(str(i + 1))
		d[values[i]] = 1
if len(res) < k:
	print('NO')
else:
	print('YES')
	print(' '.join(res[:k]))


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
if n < k or len(set(a)) < k:
	print('NO')
else:
	print('YES')
	l = []
	ind = []
	cur = 0
	for i in range(n):
		if a[i] not in l:
			l.append(a[i])
			cur += 1
			ind.append(i + 1)
		if cur == k:
			break
	print(*ind)


(n, k) = map(int, input().split())
(s, v) = (set(), [])
for (i, ai) in enumerate(input().split()):
	if ai not in s:
		s.add(ai)
		v.append(str(i + 1))
print('YES\n' + ' '.join(v[:k]) if len(v) >= k else 'NO')


a = [int(q) for q in input().strip().split()]
b = [int(q) for q in input().strip().split()]
c = list(set(b))
if len(c) < a[1]:
	print('NO')
else:
	print('YES')
	e = []
	t = 0
	for k in range(len(b)):
		if b[k] in c:
			e.append(str(k + 1))
			c.remove(b[k])
			t += 1
			if len(c) == 0 or t == a[1]:
				break
	print(' '.join(e))


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
b = set(a)
l = []
if len(b) >= k:
	print('YES')
	for i in b:
		l.append(a.index(i) + 1)
	r = sorted(l)
	for i in range(k):
		print(r[i], end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
li = list(map(int, input().split()))
dic = {}
for i in range(n):
	if li[i] not in dic:
		dic[li[i]] = i
if len(dic) < k:
	print('NO')
else:
	print('YES')
	for i in list(dic.values())[:k]:
		print(i + 1, end=' ')


def do():
	(n, k) = map(int, input().split())
	dat = list(map(int, input().split()))
	cnt = 0
	res = []
	d = {}
	for i in range(len(dat)):
		if dat[i] in d:
			continue
		d[dat[i]] = True
		cnt += 1
		res.append(i + 1)
		if cnt == k:
			break
	if cnt >= k:
		print('YES')
		print(' '.join(list(map(str, res))))
	else:
		print('NO')
do()

def templ():
	from pprint import pprint
	q = int(input())
	for _ in range(q):
		s = input()
		n = int(input())
		(n, k) = map(int, input().split())
		dat = list(map(int, input().split()))
	dat = [1, 2, 3]
	print(' '.join(list(map(str, res))))
	pass
	import math
	math.ceil(1.2)
	math.floor(1.2)
	round(1.2, 3)


(n, k) = map(int, input().split())
std = list(map(int, input().split()))
ratings = []
index = []
for i in range(n):
	if std[i] not in ratings:
		ratings.append(std[i])
		index.append(i + 1)
if len(ratings) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(index[i], end=' ')


def teams(k, students):
	result = []
	indexes = []
	for i in range(len(students)):
		if students[i] not in result:
			result.append(students[i])
			indexes.append(i + 1)
			if len(result) == k:
				print('YES')
				print(*indexes)
				return
	print('NO')
inp = list(map(int, input().split()))
n = inp[0]
k = inp[1]
students = list(map(int, input().split()))
teams(k, students)


(n, k) = map(int, input().split())
x = list(map(int, input().split()))
y = [1]
z = [x[0]]
for i in range(1, n):
	if len(y) == k:
		break
	elif x[i] not in z:
		z.append(x[i])
		y.append(i + 1)
if len(y) == k:
	print('YES')
	for i in y:
		print(i, end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
ar = list(map(int, input().split()))
ARI = []
ARN = []

def isARI(r, N):
	return ARI.count(r) == 0
for i in range(len(ar)):
	if isARI(ar[i], i):
		ARI.append(ar[i])
		ARN.append(i)
if len(ARI) < k:
	print('NO')
	exit(0)
print('YES')
s = ''
for i in range(k):
	s += str(ARN[i] + 1) + ' '
print(s)


(n, k) = [int(x) for x in input().split(' ')]
a = [int(x) for x in input().split(' ')]
if len(set(a)) < k:
	print('NO')
else:
	print('YES')
	tmp = []
	tracked = []
	for i in range(len(a)):
		if len(tmp) == k:
			break
		if a[i] in tracked:
			continue
		else:
			tracked.append(a[i])
			tmp.append(i + 1)
	for x in tmp:
		print(x, end=' ')


(N, K) = map(int, input().split())
l = list(map(int, input().split()))
L = []
for i in l:
	if i not in L:
		L.append(i)
distinct = len(L)
l1 = []
c = 0
for i in L:
	if c == K:
		break
	c += 1
	l1.append(l.index(i))
	l1[len(l1) - 1] += 1
if distinct < K:
	print('NO')
else:
	print('YES')
	print(*l1)


(n, k) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a2 = []
c = 0
i = 0
if k <= len(set(a)):
	print('YES')
	while c != k:
		if a[i] not in a2:
			print(i + 1, end=' ')
			a2.append(a[i])
			c += 1
		i += 1
else:
	print('NO')


(n, g) = map(int, input().split())
l = list(map(int, input().split()))
(k, h) = ({}, [])
if len(set(l)) >= g:
	print('YES')
	for i in range(n):
		if l[i] in k:
			pass
		else:
			k[l[i]] = i + 1
			h.append(i + 1)
	for i in range(g):
		print(h[i], end=' ')
else:
	print('NO')


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

def arr_inp():
	return [int(x) for x in input().split()]

def print_arr(arr):
	print(*arr, sep=' ')
(n, k) = inp()
a = arr_inp()
dis = {}
for i in range(n):
	if k == 0:
		break
	if a[i] not in dis.values():
		dis[str(i + 1)] = a[i]
		k -= 1
if k == 0:
	print('YES')
	print_arr(dis.keys())
else:
	print('NO')


(n, k) = tuple(map(int, input().split()))
scores = list(map(int, input().split()))
scores_set = set(scores)
indices = []
if len(scores_set) < k:
	print('NO')
else:
	j = 0
	for i in range(n):
		if scores[i] in scores_set:
			indices.append(i + 1)
			scores_set.remove(scores[i])
			j += 1
			if j == k:
				break
	print('YES')
	print(*indices, sep=' ')


import sys
import math
(n, k) = map(int, input().split())
lista = [int(x) for x in input().strip().split()]
conta = [0 for i in range(101)]
inde = []
for i in range(n):
	if conta[lista[i]] == 0:
		conta[lista[i]] = 1
		inde.append(i + 1)
if len(inde) >= k:
	print('YES')
	for i in range(k):
		print(inde[i], end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
a = [int(i) for i in input().split()]
d = []
ans = []
for i in range(n):
	if a[i] not in d:
		d.append(a[i])
		ans.append(i + 1)
if len(ans) >= k:
	print('YES')
	for i in range(k):
		print(ans[i], end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
arr = [int(x) for x in input().split()]
dist = {}
for (ind, val) in enumerate(arr):
	if val not in dist:
		dist[val] = str(ind + 1)
ans = list(dist.values())
if len(ans) >= k:
	print('YES')
	print(' '.join(ans[:k]))
else:
	print('NO')


(n, m) = map(int, input().split())
a = list(map(int, input().split()))
dict = {}
ans = []
for i in range(n):
	if a[i] in dict:
		pass
	else:
		dict[a[i]] = 1
		ans.append(i + 1)
if len(ans) >= m:
	print('YES')
	for i in range(m):
		print(ans[i], end=' ')
else:
	print('NO')


inp = input().split()
n = inp[0]
k = int(inp[1])
a = input().split()
l = []
out = []
for i in range(len(a)):
	if not int(a[i]) in l:
		k -= 1
		l.append(int(a[i]))
		out.append(str(i + 1))
	if k == 0:
		print('YES')
		print(' '.join(out))
		break
if k > 0:
	print('NO')


(n, k) = input().split(' ')
n = int(n)
k = int(k)
lista = list(map(int, input().split(' ')))
team = []
add = 1
for i in range(len(lista)):
	if len(team) == 0:
		team.append(i + 1)
		if len(team) == k:
			print('YES')
			print(*team, sep=' ')
			exit()
		continue
	for y in team:
		if lista[i] == lista[y - 1]:
			add = 0
	if add == 1:
		team.append(i + 1)
	if len(team) == k:
		print('YES')
		print(*team, sep=' ')
		exit()
	add = 1
print('NO')


(n, k) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]

def unique(v):
	d = {}
	for (i, key) in enumerate(v):
		if key in d.keys():
			pass
		else:
			d[key] = i + 1
	return d
f = unique(a)
if len(f) >= k:
	print('YES')
	print(' '.join([str(x) for x in f.values()][:k]))
else:
	print('NO')


input1 = input()
input2 = input()
input1s = input1.split(' ')
n = int(input1s[0])
k = int(input1s[1])
students = input2.split(' ')
result = []
team = []
for i in range(n):
	student = students[i]
	if student not in team:
		team.append(student)
		result.append(str(i + 1))
		k -= 1
		if k <= 0:
			break
if k > 0:
	print('NO')
else:
	print('YES')
	print(' '.join(result))


R = lambda : map(int, input().split())
(n, k) = R()
a = list(R())
ans = []
ind = []
for x in a:
	if x not in ans:
		ans.append(x)
		ind.append(a.index(x) + 1)
if len(ind) >= k:
	ind = ind[:k]
	ind = [str(i) for i in ind]
	print('YES')
	print(' '.join(ind))
else:
	print('NO')


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


(n, k) = map(int, input().split())
d = {}
i = 1
for val in input().split():
	if val in d:
		pass
	else:
		d[val] = i
	i += 1
if len(d) < k:
	print('NO')
else:
	print('YES')
	i = 0
	for val in d:
		print(d[val], end=' ')
		i += 1
		if i == k:
			break


x = input()
x = x.split()
n = int(x[0])
k = int(x[1])
x = input()
x = x.split()
for i in range(len(x)):
	x[i] = int(x[i])
dist = 0
scores = []
pos = ''
for i in range(len(x)):
	if dist == k:
		break
	if x[i] in scores:
		dist = dist
	else:
		scores.append(x[i])
		dist = dist + 1
		pos = pos + str(i + 1) + ' '
if dist < k:
	print('NO')
else:
	print('YES')
	print(pos)


(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=' ')


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
x = []
t = []
p = 0
l = 0
q = []
k = 0
for i in range(len(c)):
	t.append(c[p])
	p = p + 1
for ir in range(len(c)):
	if not c[l] in x:
		x.append(c[l])
		q.append(l)
	l = l + 1
if len(x) < b:
	print('NO')
else:
	print('YES')
	for il in range(b):
		print(q[k] + 1, end=' ')
		k = k + 1


(n, k) = list(map(int, input().split()))
a = list(map(int, input().split()))
team = []
positions = []
for i in range(n):
	if len(team) < k:
		if i == 0:
			team.append(a[0])
			positions.append(i + 1)
			continue
		if a[i] in team:
			continue
		team.append(a[i])
		positions.append(i + 1)
	else:
		break
if len(team) < k:
	print('NO')
else:
	print('YES')
	for elem in positions:
		print(elem, end=' ')


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
a = []
c = 0
for i in range(n):
	if l[i] not in a:
		a.append(l[i])
		c += 1
	if c == k:
		print('YES')
		for i in a:
			print(l.index(i) + 1, end=' ')
		break
else:
	print('NO')


def select_people(k, numbers):
	indices = []
	distinct_points = set()
	i = 0
	while k > len(indices) and i < len(numbers):
		if numbers[i] not in distinct_points:
			indices.append(i + 1)
			distinct_points.add(numbers[i])
		i += 1
	return indices

def diverse_team(k, numbers):
	distinct_points = set(numbers)
	if len(distinct_points) >= k:
		print('YES')
		print(' '.join(map(str, select_people(k, numbers))))
	else:
		print('NO')
(n, k) = map(int, input().split())
numbers = list(map(int, input().split()))
diverse_team(k, numbers)


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')


l = list(map(int, input().split()))
n = l[0]
k = l[1]
d = {}
l1 = list(map(int, input().split()))
for i in range(0, n):
	if l1[i] not in d:
		d[l1[i]] = i + 1
l2 = sorted(d.values())
if k > len(l2):
	print('NO')
else:
	print('YES')
	for i in range(0, k):
		print(l2[i], end=' ')


(n, k) = list(map(int, input().split(' ')))
rating = list(map(int, input().split(' ')))
group = []
aux_group = []
for i in range(n):
	if rating[i] not in aux_group and len(group) != k:
		aux_group.append(rating[i])
		group.append(i + 1)
	elif len(group) == k:
		break
if len(group) == k:
	print('YES')
	print(' '.join(map(str, group)))
else:
	print('NO')


def ccrs():
	return '7ata linfo ja maset'
(n, k) = map(int, input().split())
l = list(map(int, input().split()))
s = set()
m = []
for i in range(len(l)):
	if l[i] not in s:
		s.add(l[i])
		m.append(i)
if len(s) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(m[i] + 1, end=' ')


(n, k) = map(int, input().split())
seq = [int(x) for x in input().split()]
if len(set(seq)) < k:
	print('NO')
else:
	prev = set()
	count = 0
	print('YES')
	for i in range(len(seq)):
		if count == k:
			break
		if seq[i] not in prev:
			print(i + 1, end=' ')
			count = count + 1
		prev.add(seq[i])


read = lambda : map(int, input().split())
(n, k) = read()
a = []
b = []
index = 1
for x in read():
	if x not in a:
		a.append(x)
		if len(b) < k:
			b.append(index)
	index += 1
if len(b) == k:
	print('YES')
	print(*b)
else:
	print('NO')


(n, k) = map(int, input().split())
s = list(map(int, input().split()))
res = list()
ind = list()
for i in range(n):
	if not s[i] in res:
		res.append(s[i])
		ind.append(i)
if len(res) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(ind[i] + 1, end=' ')


(a, b) = map(int, input().split())
c = [int(c) for c in input().split()]
d = []
e = []
for i in c:
	if i not in d:
		d.append(i)
		e.append(c.index(i) + 1)
		if len(d) == b:
			break
if len(d) < b:
	print('NO')
else:
	print('YES')
	print(*e)


from collections import OrderedDict
(stud_1, team_num) = input().split()
(stud_1, team_num) = (int(stud_1), int(team_num))
rating_list = input().split()
rating_list1 = map(lambda x: int(x), rating_list)
rating_list1 = list(rating_list1)
non_d = []
non_d_in = []
for (pos, ele) in enumerate(rating_list1):
	if ele not in non_d:
		non_d.append(ele)
		non_d_in.append(pos + 1)
if len(non_d) >= team_num:
	print('YES')
	non_d_in = non_d_in[0:team_num]
	print(' '.join(map(str, non_d_in)))
else:
	print('NO')


(n, m) = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
l1 = set(l)
c = 0
l2 = []
l3 = []
if len(l1) >= m:
	print('YES')
	for i in range(len(l)):
		if l[i] not in l3:
			l3.append(l[i])
			l2.append(i + 1)
			c += 1
			if m == c:
				break
	for i in l2:
		print(i, end=' ')
else:
	print('NO')


(n, k) = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
z = [0] * (max(a) + 1)
for i in range(0, n):
	z[a[i]] = z[a[i]] + 1
count = 0
w = list()
for i in range(0, len(z)):
	if z[i] != 0:
		count = count + 1
		w.append(i)
y = list()
h = list()
if count < k:
	print('NO')
else:
	print('YES')
	for i in range(0, len(w)):
		for j in range(0, n):
			if w[i] == a[j]:
				y.append(j + 1)
				break
	y = sorted(y)
	for i in range(0, k):
		h.append(y[i])
	h = map(str, h)
	h = ' '.join(h)
	print(h)


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


st = [int(i) for i in input().split(' ')]
n = st[0]
k = st[1]
dif = []
difk = []
a = [int(n) for n in input().split(' ')]
for i in range(n):
	if dif.count(a[i]) == 0:
		dif.append(a[i])
		difk.append(i)
if len(difk) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(difk[i] + 1, sep=' ', end=' ')


(n, k) = map(int, input().split())
s = list(map(int, input().split()))
z = []
for n in s:
	if n not in z:
		z.append(n)
if len(z) >= k:
	print('YES')
	for n in range(k):
		print(s.index(z[n]) + 1, end=' ')
else:
	print('NO')


(n, k) = [int(x) for x in input().split()]
p = [int(x) for x in input().split()]
d = []
ind = []
for i in range(n):
	if p[i] not in d:
		d.append(p[i])
		ind.append(i + 1)
		if len(ind) >= k:
			break
if len(ind) == k:
	print('YES')
	for x in range(len(ind)):
		print(ind[x], end=' ')
else:
	print('NO')


(n, m) = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
num = []
ans = []
t = 0
for i in range(n):
	if t < m:
		if not l[i] in num:
			ans.append(i + 1)
			num.append(l[i])
			t += 1
if t != m:
	print('NO')
else:
	print('YES')
	print(*ans)


(n, k) = map(int, input().split())
A = list(map(int, input().split()))
s = set()
u = []
for i in range(n):
	if A[i] not in s:
		s.add(A[i])
		u.append(i + 1)
	if len(u) == k:
		break
if len(u) < k:
	print('NO')
else:
	print('YES')
	print(*u)


(n, k) = map(int, input().split())
lst = list(map(int, input().split()))
x = list(enumerate(lst, 1))
vel_sum = []
vel = []
for i in x:
	if not i[1] in vel_sum:
		vel_sum.append(i[1])
		vel.append(i[0])
if vel[:k].__len__() >= k:
	print('YES')
	s = ''
	for i in vel[:k]:
		s = s + str(i) + ' '
	print(s)
else:
	print('NO')


(n, m) = map(int, input().split())
a = [int(x) for x in input().split()]
new = []
ind = []
id = []
for i in range(n):
	if a[i] not in new:
		new.append(a[i])
		ind.append(i + 1)
if len(new) >= m:
	print('YES')
	for i in range(m):
		id.append(ind[i])
	print(*id)
else:
	print('NO')


(x, y) = input().split()
x = int(x)
y = int(y)
list1 = list(map(int, input().split()))
list2 = []
list2.append(0)
flag = 0
for i in range(1, x):
	for j in list2:
		if list1[i] == list1[j]:
			flag = 1
	if flag == 0:
		list2.append(i)
	else:
		flag = 0
if len(list2) >= y:
	print('YES')
	for i in range(y):
		print(list2[i] + 1, end=' ')
else:
	print('NO')


def main():
	(n, k) = list(map(int, input().split()))
	A = list(map(int, input().split()))
	B = [False] * 101
	C = []
	for i in range(n):
		if not B[A[i]]:
			B[A[i]] = i + 1
			C.append(i + 1)
	if len(C) >= k:
		print('YES')
		print(*C[:k])
	else:
		print('NO')
main()


def solve(a):
	temp = []
	res = []
	for i in range(len(a)):
		if a[i] not in temp:
			temp.append(a[i])
			res.append(i + 1)
	return res
(n, k) = map(int, input().split())
a = [int(x) for x in input().split()]
a = solve(a)
if len(a) >= k:
	print('YES')
	for i in range(k):
		print(a[i], end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
l1 = []
if len(set(l)) >= k:
	print('YES')
	c = 0
	i = 0
	while c != k:
		if l[i] not in l1:
			print(i + 1, end=' ')
			l1.append(l[i])
			c += 1
		i = i + 1
else:
	print('NO')


from collections import defaultdict
(x, y) = map(int, input().split())
a = list(map(int, input().split()))
lol = []
yo = []
f = 0
for i in range(x):
	if a[i] not in lol:
		lol.append(a[i])
		yo.append(i + 1)
	if len(lol) >= y:
		f = 1
		break
if f:
	print('YES')
	print(*yo)
else:
	print('NO')


(n, k) = map(int, input().split(' '))
data = input().split(' ')
taken = set()
takenIndexes = []
for i in range(len(data)):
	if not data[i] in taken:
		takenIndexes.append(i + 1)
		taken.add(data[i])
if len(takenIndexes) >= k:
	print('YES')
	print(' '.join(map(str, takenIndexes[:k])))
else:
	print('NO')


z = list(map(int, input().split()))
y = list(map(int, input().split()))
arr = []
rra = []
for i in range(z[0]):
	if y[i] in rra:
		continue
	else:
		arr.append(i + 1)
		rra.append(y[i])
if len(arr) >= z[1]:
	print('YES')
	for i in range(z[1]):
		if i == z[1] - 1:
			print(arr[i])
		else:
			print(arr[i], end=' ')
else:
	print('NO')


(n, k) = [int(i) for i in input().split()]
g = [int(i) for i in input().split()]
i = 0
mapa = {}
while i < n:
	if g[i] not in mapa:
		mapa[g[i]] = str(i + 1)
	i += 1
if len(mapa) >= k:
	print('YES')
	x = list(mapa)
	print(mapa[x[0]], end='')
	for i in x[1:k]:
		print(' %s' % mapa[i], end='')
else:
	print('NO')


(students, size_of_team) = [int(x) for x in input().split(' ')]
ratings = [int(x) for x in input().split(' ')]
d = {}
res = []
for i in range(students):
	if d.get(ratings[i], None) is None:
		res.append(ratings[i])
		d[ratings[i]] = i + 1
	else:
		continue
if len(res) >= size_of_team:
	print('YES')
	res_str = ''
	for i in range(size_of_team):
		res_str += str(d[res[i]]) + ' '
	print(res_str)
else:
	print('NO')


def solve(n, k, a):
	(b, c) = ([], [])
	for i in range(0, len(a)):
		if a[i] not in b and len(c) + 1 <= k:
			b.append(a[i])
			c.append(i + 1)
	return {'status': 'YES' if len(c) == k else 'NO', 'c': c}
(n, k) = map(int, input().split())
a = list(map(int, input().split()))
result = solve(n, k, a)
print(result.get('status'))
if result.get('status') == 'YES':
	nl = []
	for x in result.get('c'):
		nl.append(str(x))
	print(' '.join(nl))


from collections import deque, Counter
import array
from itertools import combinations, permutations
from math import sqrt
import unittest

def read_int():
	return int(input().strip())

def read_int_array():
	return [int(i) for i in input().strip().split(' ')]
(n, k) = read_int_array()
a = read_int_array()
d = dict()
for (i, e) in enumerate(a):
	l = d.get(e, [])
	l.append(i + 1)
	d[e] = l
if len(d) < k:
	print('NO')
else:
	print('YES')
	print(' '.join([str(d[i][0]) for i in d.keys()][:k]))


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
x = [0] * 105
ans = []
for i in range(n):
	if not x[a[i]]:
		x[a[i]] = 1
		ans.append(i + 1)
	if len(ans) == k:
		break
print('YES' if len(ans) == k else 'NO')
if len(ans) == k:
	print(*ans)


(tim, ukuran) = map(int, input().split())
daftar = [int(angka) for angka in input().split()]
angka = []
lokasi = []
for i in range(tim):
	if daftar[i] not in angka:
		angka.append(daftar[i])
		lokasi.append(i + 1)
if len(angka) >= ukuran:
	print('YES')
	for i in range(ukuran):
		print(lokasi[i], end=' ')
else:
	print('NO')


(n, m) = input().split()
a = list(map(int, input().split()))
b = []

def unique(list1):
	unique_list = []
	for x in range(len(list1)):
		if list1[x] not in unique_list:
			unique_list.append(list1[x])
			b.append(x)
	if int(m) <= len(unique_list):
		print('YES')
		for i in range(int(m)):
			print(b[i] + 1, end=' ')
	else:
		print('NO')
unique(a)


(n, k) = list(map(int, input().split()))
arr = list(map(int, input().split()))
comand = []
indexes = []
for i in range(n):
	if k > 0:
		if arr[i] not in comand:
			comand.append(arr[i])
			indexes.append(i + 1)
			k -= 1
if k > 0:
	print('NO')
else:
	print('YES')
	for i in indexes:
		print(str(i) + ' ', end='')


(a, n) = map(int, input().split())
a = list(map(int, input().split()))
sum = 0
b = []
if n <= len(set(a)):
	print('YES')
	for i in a:
		if i not in b and sum < n:
			print(a.index(i) + 1, end=' ')
			b.append(i)
			sum += 1
else:
	print('NO')


(n, k) = (int(_) for _ in input().split())
a = [int(_) for _ in input().split()]
if len(set(a)) < k:
	print('NO')
else:
	s = set()
	print('YES')
	for (i, x) in enumerate(a, 1):
		if x not in s:
			s.add(x)
			print(i, end=' ')
		if len(s) == k:
			break


params = list(input().split())
numreq = int(params[1])
stud = input().split()
if len(set(stud)) < numreq:
	print('NO')
else:
	ind = []
	used = []
	for i in range(len(stud)):
		if numreq == 0:
			break
		if stud[i] not in used:
			ind.append(i)
			used.append(stud[i])
			numreq -= 1
	print('YES')
	for i in ind:
		print(i + 1, end=' ')


from collections import defaultdict
(N, K) = map(int, input().split())
src = list(map(int, input().split()))
d = defaultdict(lambda : [])
for (i, a) in enumerate(src):
	d[a].append(i + 1)
if len(d) < K:
	print('NO')
else:
	print('YES')
	ans = []
	for a in list(d.values())[:K]:
		ans.append(a[0])
	print(*ans, sep=' ')


(n, k) = [int(x) for x in input().split()]
L = [int(x) for x in input().split()]
R = []
M = []
for i in range(n):
	if L[i] not in M:
		R.append(i + 1)
		M.append(L[i])
if len(R) >= k:
	print('YES')
	print(' '.join([str(x) for x in R[:k]]))
else:
	print('NO')


(n, k) = map(int, input().split())
inp = list(map(int, input().split()))
arr = set()
for i in range(n):
	arr.add(inp[i])
if k <= len(arr):
	print('YES')
	for i in range(n):
		if inp[i] in arr and k > 0:
			print(i + 1, end=' ')
			arr.remove(inp[i])
			k -= 1
else:
	print('NO')


(n, m) = input().split()
l = input().split()
b = []
v = set()
v.update(l)
if len(v) < int(m):
	print('NO')
else:
	print('YES')
	for i in range(int(n)):
		if l[i] != '*' and len(b) < int(m):
			b.append(i + 1)
			for j in range(i + 1, int(n)):
				if l[i] == l[j]:
					l[j] = '*'
	for i in range(len(b)):
		print(b[i], end=' ')


def calc(n, m, a):
	dic = {}
	lis = []
	for i in range(n):
		if a[i] in dic:
			continue
		elif a[i] not in dic:
			dic[a[i]] = i
		if len(dic) == m:
			break
	if len(dic) < m:
		print('NO')
	else:
		print('YES')
		s = ''
		for i in dic:
			s += str(dic[i] + 1)
			s += ' '
		print(s)
(n, m) = list(map(int, input().split()))
a = list(map(int, input().split()))
calc(n, m, a)


(n, k) = input().split()
a = list(map(int, input().split()))
b = []
c = []
count = 0
for i in range(int(n)):
	if a[i] not in b:
		b.append(a[i])
		c.append(i + 1)
		count += 1
	if count == int(k):
		print('YES')
		for i in c:
			print(str(i) + ' ', end='')
		quit()
print('NO')


lineOne = input()
lineTwo = input()
a = lineOne.split(' ')
b = lineTwo.split(' ')
answer = []
for x in range(0, int(a[0])):
	if b[x] not in answer:
		answer.append(b[x])
if len(answer) >= int(a[1]):
	answer = answer[0:int(a[1])]
	print('YES')
	finalAns = ''
	for elems in answer:
		finalAns = finalAns + ' ' + str(b.index(elems) + 1)
	print(finalAns[1:])
else:
	print('NO')


(n, k) = map(int, input().strip().split())
v = list(map(int, input().strip().split()))
g = []
r = []
c = 0
for i in range(n):
	if v[i] not in g:
		g.append(v[i])
		r.append(i + 1)
		c += 1
		if c == k:
			print('YES')
			print(*r, sep=' ')
			break
if c < k:
	print('NO')


n = input().split()
(n, k) = (int(n[0]), int(n[1]))
a = [0] * 101
ans = []
j = 0
for i in input().split():
	i = int(i) - 1
	if a[i] == 0:
		a[i] = 1
		ans += [j]
	j += 1
if len(ans) < k:
	print('NO')
else:
	print('YES')
	print(' '.join([str(i + 1) for i in ans[:k]]))


(n, k) = map(int, input().split())
arr = list(map(int, input().split()))
dict = {}
count = 0
for i in range(n):
	if arr[i] not in dict:
		dict[arr[i]] = i + 1
		count += 1
		if count == k:
			break
if count == k:
	print('YES')
	for (k, v) in dict.items():
		print(v, end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
used = [False for i in range(101)]
answer = []
for i in range(n):
	if used[a[i]] == False:
		answer.append(i)
		used[a[i]] = True
if len(answer) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(answer[i] + 1, end=' ')


l = input().split()
n = int(l[0])
k = int(l[1])
students = input().split()
arr = []
result = ''
for student in students:
	if student not in arr:
		arr.append(student)
if len(arr) >= k:
	print('YES')
	for i in range(k):
		result += str(students.index(arr[i]) + 1) + ' '
	print(result)
else:
	print('NO')


(n, k) = [int(s) for s in input().split()]
a = [int(s) for s in input().split()]
chosen = []
keys = []
for i in range(len(a)):
	if a[i] not in chosen:
		chosen.append(a[i])
		keys.append(i + 1)
	if len(chosen) == k:
		break
if len(chosen) >= k:
	print('YES')
	for e in keys:
		print(e, end=' ')
else:
	print('NO')


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


k = input().split()
l = input().split()
b = set(l)
if len(b) < int(k[1]):
	print('NO')
else:
	print('YES')
	c = []
	inde = []
	for i in range(int(k[0])):
		if l[i] not in c:
			c.append(l[i])
			if len(c) < int(k[1]):
				print(i + 1, end=' ')
			else:
				print(i + 1)
				break


from collections import *
(n, k) = list(map(int, input().split()))
data = list(map(int, input().split()))
c = set()
res = ''
d = 0
for i in range(n):
	if data[i] not in c:
		d += 1
		res += str(i + 1) + ' '
		c.add(data[i])
		if d == k:
			break
if d >= k:
	print('YES')
	print(res[:-1])
else:
	print('NO')


import re
s = input()
n = re.split(' ', s)
n = [int(item) for item in n]
s = input()
n1 = re.split(' ', s)
n1 = [int(item) for item in n1]
alr = []
ind = []
k = 0
i = 0
for i in range(0, n[0]):
	if n1[i] not in alr and k != n[1]:
		alr.append(n1[i])
		ind.append(i + 1)
		k += 1
	if k == n[1]:
		break
t = ''
if k == n[1]:
	print('YES')
	for i in ind:
		t += str(i) + ' '
	print(t[:len(t) - 1])
else:
	print('NO')


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


(n, k) = map(int, input().split())
a = [int(x) for x in input().split()]
taken = set({})
people = set({})
count = 0
for i in range(n):
	if a[i] not in taken:
		taken.add(a[i])
		people.add(i + 1)
		count = count + 1
	if count == k:
		break
if count == k:
	print('YES')
	people = list(people)
	for el in people:
		print(el, end=' ')
else:
	print('NO')


(n, k) = input().split(' ')
a = input().split(' ')
ans = {}
for i in range(len(a)):
	if a[i] not in ans:
		ans[a[i]] = i
if len(ans) < int(k):
	print('NO')
else:
	print('YES')
	c = 0
	for i in ans:
		print(ans[i] + 1, end=' ')
		c += 1
		if c == int(k):
			break


(n, k) = input().split(' ')
array = input().split(' ')
aux = 1
repetidos = {}
for elem in array:
	if not elem in repetidos:
		repetidos[elem] = 1
	else:
		repetidos[elem] += 1
if int(k) <= len(repetidos):
	print('YES')
	for elem in repetidos:
		if aux > int(k):
			break
		print(array.index(elem) + 1, end=' ')
		aux += 1
else:
	print('NO')


nk = list(map(int, input().split()))
a = list(map(int, input().split()))
s = []
r = []
for i in range(nk[0]):
	if a[i] not in s:
		s.append(a[i])
		r.append(i + 1)
		if len(s) == nk[1]:
			break
if len(s) == nk[1]:
	print('YES')
	print(' '.join(map(str, r)))
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 main():
	(n, k) = input().split(' ')
	n = int(n)
	k = int(k)
	s = [int(i) for i in input().split(' ')]
	new_s = []
	idx = []
	for i in range(len(s)):
		if s[i] not in new_s:
			new_s.append(s[i])
			idx.append(i + 1)
	if len(new_s) >= k:
		print('YES')
		print(' '.join([str(i) for i in idx[:k]]))
	else:
		print('NO')
main()


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


input_ = list(input().split(' '))
students_number = int(input_[0])
team_size = int(input_[-1])
students_rating = list(input().split(' '))
lookup = {}
for (idx, student) in enumerate(students_rating):
	if len(lookup) >= team_size:
		break
	if student not in lookup:
		lookup[student] = idx + 1
if len(lookup) < team_size:
	print('NO')
else:
	team = []
	for student in lookup:
		team.append(str(lookup[student]))
		team.append(' ')
	print('YES')
	print(''.join(team[:-1]))


def solve(data):
	(n, k) = map(int, data[0].split())
	a = list(map(int, data[1].split()))
	res = {}
	done = False
	for i in range(len(a)):
		if a[i] not in res:
			res.setdefault(a[i], i + 1)
		if len(res.keys()) >= k:
			done = True
			break
	if done:
		return ('YES', sorted(res.values()))
	else:
		return ('NO', None)
ip = []
ip.append(input().strip())
ip.append(input().strip())
(b, r) = solve(ip)
if r is None:
	print(b)
else:
	print(b)
	print(' '.join((str(x) for x in r)))


(qtd, size) = map(int, input().split())
students = list(map(int, input().split()))
catch = set()
resp = list()
for i in range(qtd):
	if students[i] not in catch:
		catch.add(students[i])
		resp.append(i + 1)
		size -= 1
		if size == 0:
			break
if size == 0:
	print('YES')
	print(*resp)
else:
	print('NO')


import sys
from collections import Counter
(n, k) = map(int, input().split())
a = list(map(int, input().split()))
s = set(a)
res = []
if len(s) >= k:
	print('YES')
	for i in s:
		res.append(a.index(i))
	res.sort()
	for j in range(k):
		print(res[j] + 1, end=' ')
else:
	print('NO')


(a, b) = map(int, input().split())
lista = list(map(int, input().split()))
saida = []
saida2 = []
for i in range(1, len(lista) + 1):
	if lista[i - 1] not in saida2:
		saida.append(i)
		saida2.append(lista[i - 1])
		if len(saida) == b:
			break
if len(saida) >= b:
	print('YES')
	for i in saida:
		print(i, end=' ')
	print()
else:
	print('NO')


z = [int(n) for n in input().split()]
s = [int(n) for n in input().split()]
t = []
for n in s:
	if n not in t:
		t.append(n)
if len(t) >= z[1]:
	print('YES')
	for n in range(z[1]):
		print(s.index(t[n]) + 1, end=' ')
else:
	print('NO')


import os, sys, math

def main():
	(n, k) = [int(x) for x in input().split()]
	l = [int(x) for x in input().split()]
	occoured = set()
	ans = []
	for i in range(n):
		if l[i] not in occoured:
			occoured.add(l[i])
			ans.append(i + 1)
			if len(ans) == k:
				break
	else:
		print('NO')
		return
	print('YES')
	print(' '.join((str(x) for x in ans)))

def debug(*args):
	if 'DEBUG' in os.environ:
		print(*args)
main()


(n, k) = map(int, input().split())
l = [int(x) for x in input().split()]
ans = []
index = []
for i in range(len(l)):
	if l[i] not in ans:
		ans.append(l[i])
		index.append(i + 1)
if len(ans) >= k:
	print('YES')
	for i in range(k):
		print(index[i], end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
array = list(map(int, input().split()))
visited = []
y = []
for (index, element) in enumerate(array):
	if element not in visited:
		y.append(index + 1)
		visited.append(element)
if len(y) < k:
	print('NO')
else:
	print('YES')
	print(' '.join(map(str, y[0:k])))


(n, m) = list(map(int, input().strip().split()[:2]))
z = list(map(int, input().strip().split()[:n]))
l = []
for x in z:
	if z.index(x) + 1 not in l:
		l.append(z.index(x) + 1)
if len(l) >= m:
	print('YES')
	print(*l[:m])
else:
	print('NO')


(n, k) = [int(s) for s in input().split(' ')]
a = [int(s) for s in input().split(' ')]
d = dict()
for i in range(len(a)):
	x = a[i]
	if not x in d:
		d[x] = (x, i + 1)
res = []
if len(d) < k:
	print('NO')
else:
	print('YES')
	i = 0
	for x in d:
		res.append(d[x][1])
		i = i + 1
		if i >= k:
			break
	print(' '.join([str(x) for x in res]))


def main():
	(n, k) = map(int, input().split())
	a = [int(x) for x in input().split()]
	s = set()
	b = []
	for (i, x) in enumerate(a, 1):
		if x not in s:
			s.add(x)
			b.append(i)
	if len(b) >= k:
		print('YES')
		print(*b[:k])
	else:
		print('NO')
main()


(n, k) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
(_set, _ans) = (set(), [])
for i in range(n):
	if not a[i] in _set:
		_set = _set | {a[i]}
		_ans += [i + 1]
print('YES' if len(_set) >= k else 'NO')
if len(_set) >= k:
	[print(_ans[i], end=' ') for i in range(k)]


(n, k) = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]
ans = []
ppl = []
for (i, v) in enumerate(x):
	if v not in ppl:
		ppl.append(v)
		ans.append(i + 1)
	if len(ans) >= k:
		print('YES')
		print(' '.join([str(x) for x in ans]))
		exit()
print('NO')


def read_nums():
	return [int(x) for x in input().split()]

def main():
	(n, k) = read_nums()
	ratings = read_nums()
	if len(set(ratings)) < k:
		print('NO')
		return
	print('YES')
	saved = set()
	c = 0
	for (index, num) in enumerate(ratings):
		if num in saved:
			continue
		if c == k:
			break
		c += 1
		print(index + 1, end=' ')
		saved.add(num)
main()


(n, k) = map(int, input().split())
e = list(map(int, input().split()))
res = []
res1 = []
for i in range(n):
	if e[i] not in res:
		res.append(e[i])
		res1.append(i + 1)
		k -= 1
	if k == 0:
		break
if k != 0:
	print('NO')
else:
	print('YES')
	print(*res1)


(numero, entrada) = map(int, input().split())
a = list(map(int, input().split()))
(b, c) = ([], [])
for i in range(0, len(a)):
	if a[i] not in b and len(c) + 1 <= entrada:
		b.append(a[i])
		c.append(i + 1)
if len(c) == entrada:
	print('YES')
	nl = []
	for x in range(0, len(c)):
		nl.append(str(c[x]))
	print(' '.join(nl))
else:
	print('NO')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
flag = True
b = set(a)
if len(b) >= k:
	print('YES')
	ans = []
	for i in range(n):
		if a[i] in b:
			ans.append(i + 1)
			b.remove(a[i])
	print(*ans[:k])
else:
	print('NO')


def main():
	(n, k) = [int(t) for t in input().split()]
	arr = [int(t) for t in input().split()]
	nums = []
	indexes = []
	for i in range(len(arr)):
		if arr[i] not in nums:
			nums.append(arr[i])
			indexes.append(str(i + 1))
			if len(nums) == k:
				print('YES')
				print(' '.join(indexes))
				return
	print('NO')
main()


(n, k) = map(int, input().split())
A = list(map(int, input().split()))
b = set(A)
c = []
if len(b) >= k:
	print('YES')
	for i in b:
		for j in A:
			if i == j:
				c.append(A.index(j) + 1)
				break
	c.sort()
	for s in range(k):
		print(c[s], end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
x = list(map(int, input().split()))
s = set(x)
lst = []
if k > len(s):
	print('NO')
else:
	print('YES')
	lst = list(dict.fromkeys(x))
	ind = []
	for i in range(len(lst)):
		ind.append(x.index(lst[i]) + 1)
	print(*sorted(ind[:k]))


(n, k) = input().split()
n = int(n)
k = int(k)
l = []
l = input().split()
b = {}
for i in range(len(l)):
	if l[i] not in b.values():
		b[i] = l[i]
if len(b.keys()) >= k:
	l1 = list(map(lambda x: x + 1, b.keys()))
	print('YES')
	for i in range(k):
		print(l1[i], end=' ')
else:
	print('NO')


(size, want) = map(int, input().split())
unique = set()
l = list(map(int, input().split()))
ans = []
for i in l:
	unique.add(i)
step = 0
if len(unique) >= want:
	print('YES')
	for (j, i) in enumerate(l):
		if step == want:
			break
		if i in unique:
			unique.remove(i)
			ans.append(str(j + 1))
			step += 1
	print(' '.join(ans))
else:
	print('NO')


(n, s) = map(int, input().split())
l = list(map(int, input().split()))
w = []
t = []
for i in range(n):
	if l[i] not in w:
		w.append(l[i])
		t.append(l.index(l[i]))
if len(w) >= s:
	print('YES')
	for i in range(s):
		print(t[i] + 1, end=' ')
else:
	print('NO')


import math
a = input().split()
n = int(a[0])
k = int(a[1])
a = []
for i in range(0, 1000):
	a.append(0)
Imas = []
inp = input().split()
for i in range(n):
	if a[int(inp[i])] == 0:
		a[int(inp[i])] += 1
		Imas.append(i)
s = ''
if len(Imas) >= k:
	print('YES')
	for i in range(k):
		if i != k - 1:
			s += str(Imas[i] + 1) + ' '
		else:
			s += str(Imas[i] + 1)
	print(s)
else:
	print('NO')


(n, k) = map(int, input().split())
x = list(map(int, input().split()))
dict = {}
for i in x:
	if i not in dict and len(dict) < k:
		dict[i] = x.index(i) + 1
if len(dict) >= k:
	print('YES')
	for i in dict:
		print(dict[i], end=' ')
else:
	print('NO')


(n, t) = map(int, input().split())
lis = list(map(int, input().split()))
count = 0
lisa = []
lista = []
for i in range(n):
	if count < t:
		if lis[i] not in lisa:
			count += 1
			lisa.append(lis[i])
			lista.append(i + 1)
if len(lista) != t:
	print('NO')
else:
	print('YES')
	for i in lista:
		print(i, end=' ')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
used = list()
res = list()
cur = 0
for i in range(n):
	if a[i] not in used:
		cur += 1
		res.append(i + 1)
		used.append(a[i])
		if cur == k:
			print('YES')
			print(*res)
			exit(0)
print('NO')


import sys
(a, b) = list(map(int, input().split()))
arr = list(map(int, input().split()))
d = dict()
cnt = 0
res = list()
for (i, v) in enumerate(arr):
	if v not in d:
		d[v] = True
		cnt += 1
		res.append(i + 1)
	if len(res) == b:
		print('YES')
		print(' '.join(map(str, res)))
		sys.exit()
print('NO')


(n, k) = map(int, input().split())
li = list(map(int, input().split()))
num = []
ans = []
for i in range(n):
	if li[i] not in num:
		ans.append(i + 1)
		num.append(li[i])
if len(ans) >= k:
	print('YES')
	for i in range(k):
		print(ans[i], end=' ')
else:
	print('NO')


(a, b) = map(int, input().split())
x = list(map(int, input().split()))
j = 0
z = []
r = set(x)
if len(r) >= b:
	print('YES')
	for i in range(len(x)):
		if x[i] in z:
			continue
		if x[i] in r:
			print(i + 1, end=' ')
			z.append(x[i])
			j = j + 1
		if j == b:
			break
else:
	print('NO')


(n1, n2) = map(int, input().split())
lis = input().split(' ')
lis2 = []
count = []
for i in range(n1):
	for j in range(len(lis)):
		if lis[i] not in lis2:
			lis2.append(lis[i])
			count.append(i + 1)
		else:
			lis2.remove(lis[i])
			lis2.append(lis[i])
if len(lis2) == n2:
	print('YES')
	print(*count)
elif len(lis2) > n2:
	n3 = len(count)
	c = n3
	for k in range(n2, n3):
		count.pop()
	print('YES')
	print(*count)
else:
	print('NO')


import sys
from math import sqrt, floor, factorial
from collections import deque, Counter
inp = sys.stdin.readline
read = lambda : list(map(int, inp().strip().split()))

def solve():
	(n, k) = read()
	arr = read()
	dic = dict()
	for i in range(n):
		if not arr[i] in dic:
			dic[arr[i]] = i
			if len(dic) == k:
				break
	if len(dic.keys()) >= k:
		print('YES')
		print(*[dic[i] + 1 for i in dic])
	else:
		print('NO')
solve()


(n, k) = map(int, input().split())
list = map(int, input().split())
indices = []
disVal = []
counter = 1
for i in list:
	if i not in disVal:
		indices.append(counter)
		disVal.append(i)
	counter += 1
if len(indices) >= k:
	print('YES')
	print(*indices[:k])
else:
	print('NO')


def int_lst_input():
	return [int(val) for val in input().split(' ')]

def int_input():
	return int(input())

def print_lst(lst):
	print(' '.join([str(val) for val in lst]))

def solve():
	(n, k) = int_lst_input()
	a = int_lst_input()
	seen = set()
	res = []
	for (i, val) in enumerate(a):
		if val not in seen:
			res.append(i + 1)
			seen.add(val)
		if len(res) == k:
			break
	if len(res) == k:
		print('YES')
		print_lst(res)
	else:
		print('NO')
solve()


def main():
	(n, k) = map(int, input().split())
	vecTeams = list(map(int, input().split()))
	(indexVec, lenIndexVec) = uniqueSet(vecTeams, n)
	if lenIndexVec < k:
		print('NO')
	else:
		print('YES')
		for i in range(k):
			print(indexVec[i], end=' ')

def uniqueSet(vec, n):
	uniqueVec = []
	uniqueIndex = []
	lenIndex = 0
	for x in vec:
		if x not in uniqueVec:
			uniqueVec.append(x)
			uniqueIndex.append(vec.index(x) + 1)
			lenIndex += 1
	return (uniqueIndex, lenIndex)
main()


(n, k) = map(int, input().split())
t = list(map(int, input().split()))
s = set(t)
if len(s) < k:
	print('NO')
else:
	num = 0
	print('YES')
	s = sorted(s, key=t.index)
	for x in s:
		if num == k:
			break
		print(t.index(x) + 1, end=' ')
		num += 1


a = list(input().split())
c = list(input().split())
f = []
for i in range(0, len(c)):
	if c[i] not in f:
		f.append(c[i])
if len(f) < int(a[1]):
	print('NO')
if len(f) >= int(a[1]):
	print('YES')
	for i in range(0, int(a[1])):
		print(c.index(f[i]) + 1, end=' ')


def main():
	line = str(input()).split()
	(n, k) = (int(line[0]), int(line[1]))
	line = str(input()).split()
	memo = {}
	for i in range(len(line)):
		r = int(line[i])
		if not r in memo:
			memo.update({r: i + 1})
		if len(memo) == k:
			print('YES')
			print(*memo.values(), sep=' ')
			return
	print('NO')
main()


lol = [int(i) for i in input().split()]
a = lol[0]
b = lol[1]
lox = [int(i) for i in input().split()]
dope = set()
for j in lox:
	dope.add(j)
if len(dope) < b:
	print('NO')
else:
	boi = set()
	da = []
	for q in range(len(lox)):
		if lox[q] in dope and lox[q] not in boi:
			boi.add(lox[q])
			da.append(q + 1)
	print('YES')
	bs = 0
	for k in da:
		bs += 1
		print(k, end=' ')
		if bs == b:
			break


(n, k) = input().split(' ')
n = int(n)
k = int(k)
arr = [int(x) for x in input().split()]
index = []
used = []
for i in range(n):
	if k == 0:
		break
	val = arr[i]
	if not val in used:
		used.append(val)
		index.append(i + 1)
		k -= 1
if k == 0:
	print('YES')
	print(' '.join((str(x) for x in index)))
else:
	print('NO')


def main():
	(n, k) = map(int, input().split())
	x = list(map(int, input().split()))
	dic = {}
	for i in range(n):
		if x[i] not in dic.keys():
			dic[x[i]] = i + 1
	if len(dic.keys()) >= k:
		print('YES')
		x = list(dic.values())[0:k]
		print(*x, sep=' ')
	else:
		print('NO')
main()


def main():
	(n, k) = tuple(map(int, input().split()))
	a = tuple(map(int, input().split()))
	d = {}
	q = 0
	for x in a:
		if not x in d:
			d[x] = 0
			q += 1
	if q < k:
		print('NO')
		return
	print('YES')
	q = 0
	for i in range(len(a)):
		if q == k:
			return
		if d[a[i]] == 0:
			print(i + 1, end=' ')
			d[a[i]] = 1
			q += 1
main()


(n, k) = map(int, input().split())
t = []
t += map(int, input().split())
ans = []
ans2 = []
for i in range(n):
	if t[i] not in ans2:
		ans.append(i + 1)
		ans2.append(t[i])
if len(ans) >= k:
	print('YES')
	for i in range(k):
		print(ans[i], end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
cnt = 0
lst = []
res = []
lst = list(map(int, input().split()))
for i in range(n):
	ok = True
	for j in range(i):
		if lst[j] == lst[i]:
			ok = False
	if ok:
		res.append(i + 1)
if len(res) >= k:
	print('YES')
	for i in range(k):
		print(res[i], end=' ')
else:
	print('NO')


tedad = [0 for i in range(101)]
a = input()
a = a.split(' ')
b = input()
b = b.split(' ')
tedad_nahayi = [int(b[i]) for i in range(int(a[0]))]
list_nahayi = [0 for i in range(int(a[0]))]
counter = 0
for i in tedad_nahayi:
	tedad[i] += 1
for x in tedad:
	if x != 0:
		counter += 1
if counter < int(a[1]):
	print('NO')
else:
	print('YES')
	for x in range(len(tedad)):
		if tedad[x] != 0:
			list_nahayi[tedad_nahayi.index(x)] = tedad_nahayi.index(x) + 1
counter = 0
for i in list_nahayi:
	if i != 0:
		print(i, end=' ')
		counter += 1
	if counter >= int(a[1]):
		break


(n, k) = list(map(int, input().split()))
a = list(map(int, input().split()))
d = {}
r = []
for (i, v) in enumerate(a):
	if v in d:
		continue
	else:
		d[v] = 0
		r.append(i + 1)
if len(r) >= k:
	print('YES')
	print(*r[0:k])
else:
	print('NO')


si = str(input())
si = si.split(' ')
n = int(si[0])
k = int(si[1])
dic = {}
c = 0
si = str(input())
si = si.split(' ')
for i in range(len(si)):
	inp = int(si[i])
	if inp not in dic:
		dic[inp] = i
		c = c + 1
if c >= k:
	print('YES')
	st = ''
	c = 0
	for i in dic.values():
		if c == k:
			break
		st = st + str(i + 1) + ' '
		c = c + 1
	print(st)
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) = [int(x) for x in input().split(' ')]
lis = [int(x) for x in input().split(' ')]
lis1 = []
index = []
for i in range(n):
	if lis[i] not in lis1:
		lis1.append(lis[i])
		index.append(i + 1)
if len(lis1) >= k:
	print('YES')
	for i in range(k):
		print(index[i], end=' ')
else:
	print('NO')


def main():
	[n, k] = [int(_) for _ in input().split()]
	a = [int(_) for _ in input().split()]
	marked = [1] * n
	for i in range(n - 1):
		if marked[i] == 1:
			for j in range(i + 1, n):
				if a[i] == a[j]:
					marked[j] = 0
	if sum(marked) >= k:
		print('YES')
		i = 0
		j = 0
		results = [''] * k
		while i < k:
			while marked[j] == 0:
				j += 1
			results[i] = str(j + 1)
			i += 1
			j += 1
		print(' '.join(results))
	else:
		print('NO')
main()


(n, m) = map(int, input().split())
l1 = [*map(int, input().split())]
a = []
e = set(l1)
if len(e) < m:
	print('NO')
	exit()
print('YES')
for i in e:
	a.append(l1.index(i) + 1)
a.sort()
print(*a[:m])


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
li = []
index = []
for i in range(len(a)):
	if a[i] not in li:
		li.append(a[i])
		index.append(i + 1)
if len(index) < k:
	print('NO')
else:
	print('YES')
	print(*index[0:k])


(n, k) = list(map(int, input().split()))
a = list(map(int, input().split()))
b = set()
c = set()
for (i, x) in enumerate(a):
	if x not in c:
		b.add(i + 1)
		c.add(x)
	if len(b) == k:
		print('YES')
		for (j, y) in enumerate(b):
			print(y, end=' ')
		print()
		exit()
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])


entrada = [int(x) for x in input().split()]
tam_time = entrada[1]
ratings = [int(x) for x in input().split()]
time = []
indices = []
indice = 0
ok = 0
for i in ratings:
	indice += 1
	if i not in time:
		time.append(i)
		indices.append(indice)
while True:
	if len(time) == tam_time:
		print('YES')
		print(' '.join(map(str, indices)))
		break
	elif len(time) > tam_time:
		time.pop()
		indices.pop()
	else:
		print('NO')
		break


x = set()
distinct_indices = []
no_of_distinct_indices = 0
input_list = list(map(int, input().split(' ')))
n = input_list[0]
k = input_list[1]
k_distinct_indices = 0
number_list = list(map(int, input().split(' ')))
for (i, number) in enumerate(number_list):
	if number not in x:
		x.add(number)
		distinct_indices.append(i + 1)
		no_of_distinct_indices = no_of_distinct_indices + 1
		if no_of_distinct_indices == k:
			k_distinct_indices = 1
			break
if k_distinct_indices == 1:
	print('YES')
	for i in distinct_indices:
		print(i, end=' ')
else:
	print('NO')


rd = lambda : map(int, input().split())
(n, k) = rd()
a = rd()
r = []
p = set()
for i in range(n):
	x = next(a)
	if x not in p:
		r.append(i + 1)
		p.add(x)
if len(r) < k:
	print('NO')
else:
	print('YES')
	print(*r[:k])


from collections import defaultdict as dfd
(N, K) = map(int, input().split())
A = list(map(int, input().split()))
B = dfd(list)
if len(set(A)) >= K:
	t = []
	for i in range(len(A)):
		B[A[i]].append(i + 1)
	for (k, v) in B.items():
		t.append(v[0])
	t.sort()
	print('YES')
	for i in range(K):
		print(t[i], end=' ')
else:
	print('NO')


def main():
	(n, k) = map(int, input().split())
	S = list(map(int, input().split()))
	X = [0 for _ in range(101)]
	m = 0
	E = [0 for _ in range(k)]
	for i in range(n):
		if X[S[i]] == 0:
			m += 1
			X[S[i]] = 1
			if m > k:
				break
			E[m - 1] = str(i + 1)
	if m >= k:
		print('YES')
		print(' '.join(E))
	else:
		print('NO')
main()


l = input().split()
n = int(l[0])
k = int(l[1])
reap = 0
v = input().split()
v2 = []
for i in range(n):
	if int(v[i]) not in v2:
		v2.append(int(v[i]))
	else:
		reap += 1
if n - reap < k:
	print('NO')
else:
	v2 = []
	v3 = []
	for i in range(n):
		if v[i] not in v2:
			v2.append(v[i])
			v3.append(str(i + 1))
			if len(v3) == k:
				break
	print('YES')
	print(' '.join(v3))


from typing import List
(n, k) = input().split()
n = int(n)
k = int(k)
o = k
students = [int(x) for x in input().split()]
index: List[int] = []
s = []
for i in students:
	if k == 0:
		break
	if i not in s:
		s.append(i)
		k = k - 1
		index.append(students.index(i) + 1)
if index.__len__() == o:
	print('YES')
	print(' '.join(map(str, index)))
else:
	print('NO')


(n, m) = map(int, input().split())
a = list(map(int, input().split()))
cnt = []
k = 0
for x in a:
	if x not in cnt:
		cnt.append(x)
if len(cnt) >= m:
	print('YES')
	i = 0
	while i < m:
		print(a.index(cnt[i]) + 1, end=' ')
		i += 1
else:
	print('NO')


(n, k) = list(map(int, input().split(' ')))
(el, st, pos) = (list(map(int, input().split(' '))), [], [])
for i in range(len(el)):
	if el[i] not in st:
		pos.append(i)
		st.append(el[i])
print('NO' if k > len(pos) else 'YES\n' + ' '.join([str(pos[i] + 1) for i in range(k)]))


x = input()
x = x.split()
x = list(map(int, x))
y = input()
y = y.split()
y = list(map(int, y))
a = 0
b = []
z = list(dict.fromkeys(y))
lz = len(z)
if lz >= x[1]:
	print('YES')
	for i in range(len(y)):
		h = i
		if len(b) < x[1]:
			if y[h] == z[a]:
				b.append(h + 1)
				a += 1
	print(*b, sep=' ')
if lz < x[1]:
	print('NO')


(no, num) = map(int, input().split(' '))
arr = list(map(int, input().split(' ')))
already = []
res = []
for i in range(len(arr)):
	if arr[i] not in already:
		already.append(arr[i])
		res.append(i + 1)
	if len(res) == num:
		break
if len(res) == num:
	print('YES')
	string = ''
	for ch in res:
		string += str(ch) + ' '
	print(string)
else:
	print('NO')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
c = 0
s = set()
res = []
for i in range(n):
	if a[i] not in s:
		c += 1
		s.add(a[i])
		res.append(str(i + 1))
if c < k:
	print('NO')
else:
	print('YES')
	print(' '.join(res[:k]))


(_, k) = map(int, input().split())
ai = [i for i in input().split()]
temp_ai = set()
cache = list()
for i in range(len(ai)):
	if ai[i] not in temp_ai:
		temp_ai.add(ai[i])
		cache.append(i + 1)
if len(cache) >= k:
	print('YES')
	print(' '.join([str(i) for i in cache[:k]]))
else:
	print('NO')


firstline = input().split()
secondline = list(map(int, input().split()))
k = int(firstline[0])
n = int(firstline[1])
rates = []
indexes = []
for i in range(len(secondline)):
	if secondline[i] not in rates:
		rates.append(secondline[i])
		indexes.append(i + 1)
if len(rates) >= n:
	print('YES\n', ' '.join(map(str, indexes[:n])), sep='')
else:
	print('NO')


n1 = input().split()
n = int(n1[0])
k = int(n1[1])
n2 = input().split()
l = []
nums = []
count = 0
for x in range(0, n):
	y = int(n2[x])
	l.append(y)
	if y in nums:
		continue
	else:
		nums.append(y)
		count += 1
if count < k:
	print('NO')
else:
	print('YES')
	st = ''
	for z in nums[:k]:
		z1 = l.index(z) + 1
		st = st + str(z1) + ' '
	print(st)


(n, k) = list(map(int, input().split(' ')))
a = list(map(int, input().split(' ')))
s = set([])
res = []
for (ind, num) in enumerate(a):
	if num not in s:
		s.add(num)
		res.append(ind + 1)
	if len(res) == k:
		break
if len(res) == k:
	print('YES')
	print(*res)
else:
	print('NO')


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
(temp, temp1) = ({}, [])
for val in range(n):
	if temp1.count(l[val]) == 0:
		temp1 += [l[val]]
		temp[val + 1] = l[val]
key_list = list(temp.keys())
if len(key_list) >= k:
	print('YES')
	print(*key_list[0:k])
else:
	print('NO')


(n, k) = input().split()
n = int(n)
k = int(k)
notas = []
notas = input().split()
formado = 0
membros = 0
for i in range(n):
	notas[i] = int(notas[i])
time = []
valor = []
for i in range(n):
	if membros < k:
		if notas[i] not in valor:
			time.append(i + 1)
			valor.append(notas[i])
			membros += 1
	else:
		formado = 1
if membros == k:
	formado = 1
if formado:
	print('YES')
	for j in range(k):
		time[j] = str(time[j])
	printavel = ' '
	print(printavel.join(time))
else:
	print('NO')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
d = {}
for item in a:
	if item in d:
		d[item] += 1
	else:
		d[item] = 1
if len(d) < k:
	print('NO')
else:
	print('YES')
	i = 1
	for item in d:
		print(a.index(item) + 1, end=' ')
		i += 1
		if i == k + 1:
			break


(a, b) = map(int, input().split())
li = list(map(int, input().split()))
li2 = []
c = 0
for i in range(a):
	if li[i] not in li2:
		li2.append(li[i])
		c += 1
if c > b - 1:
	d = 0
	print('YES')
	for item in li2:
		print(li.index(item) + 1, end=' ')
		d += 1
		if d == b:
			break
else:
	print('NO')


(n, k) = list(map(int, input().split()))
astr = list(map(int, input().split()))
g = []
h = []
for i in range(len(astr)):
	if astr[i] not in g:
		h.append(i + 1)
		g.append(astr[i])
if len(h) >= k:
	print('YES')
	for i in range(k):
		print(h[i], end=' ')
else:
	print('NO')


from collections import *
(n, k) = map(int, input().split())
a = list(map(int, input().split()))
f = Counter(a)
if len(f) < k:
	print('NO')
else:
	print('YES')
	c = 0
	for i in f.keys():
		c += 1
		print(a.index(i) + 1, end=' ')
		if c == k:
			break


(n, k) = [int(s) for s in input().split(' ')]
a = [int(s) for s in input().split(' ')]
if len(set(a)) >= k:
	lst1 = []
	lst2 = []
	for i in range(n):
		if a[i] not in lst1:
			lst1.append(a[i])
			lst2.append(str(i + 1))
		if len(lst1) == k:
			break
	print('YES')
	print(' '.join(lst2))
else:
	print('NO')


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def main():
	(n, m) = LI()
	a = LI()
	r = []
	s = set()
	for i in range(n):
		c = a[i]
		if c in s:
			continue
		s.add(c)
		r.append(i + 1)
	if len(r) < m:
		return 'NO'
	return 'YES\n{}'.format(' '.join(map(str, r[:m])))
print(main())


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
c = [0] * 105
ans = []
for i in range(n):
	if c[l[i]] == 0:
		ans.append(i + 1)
	c[l[i]] = 1
if len(ans) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(ans[i], end=' ')


data = [int(a) for a in input('').split()]
n = data[0]
k = data[1]
rating = [int(b) for b in input('').split()]
list1 = sorted(set(rating), key=rating.index)
if len(list1) >= k:
	print('YES')
	for i in range(0, k):
		print(rating.index(list1[i]) + 1, end=' ')
	print('')
else:
	print('NO')


(n, k) = map(int, input().split())
A = list(map(int, input().split()))
B = [A[0]]
ans = [1]
flag = 0
for i in range(1, n):
	flag = 0
	for item in B:
		if A[i] == item:
			flag = 1
			break
	if flag == 0:
		B.append(A[i])
		ans.append(i + 1)
if len(ans) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(ans[i], end=' ')


try:
	(n, k) = map(int, input().split())
	a = list(map(int, input().split()))
	b = []
	c = []
	b.append(a[0])
	c.append(1)
	for i in range(1, n):
		if a[i] not in b:
			b.append(a[i])
			c.append(i + 1)
	if len(b) >= k:
		print('YES')
		for i in range(k):
			print(c[i], end=' ')
	else:
		print('NO')
except:
	pass


(n, m) = input().split(' ')
(n, m) = (int(n), int(m))
a = input().split()
se = set({})
ans = []
flag = True
for i in range(n):
	if a[i] not in se:
		ans.append(i + 1)
		se.add(a[i])
if len(ans) >= m:
	print('YES')
	for i in range(m):
		print(ans[i], end=' ')
else:
	print('NO')


def check(i, a, c):
	for x in range(i + 1, len(c)):
		if c[x] == a:
			c[x] = -1
(n, k) = input().strip().split(' ')
(n, k) = [int(n), int(k)]
a = list(map(int, input().strip().split(' ')))
count = 0
for x in range(0, len(a)):
	if a[x] != -1:
		check(x, a[x], a)
for x in range(0, len(a)):
	if a[x] != -1:
		count += 1
if count >= k:
	print('YES')
	for x in range(0, len(a)):
		if k == 0:
			break
		if a[x] != -1:
			print(x + 1, end=' ')
			k -= 1
	print()
else:
	print('NO')


(n, k) = map(int, input().split())
ans = []
data = list(map(int, input().split()))
rate = set()
for i in range(n):
	el = data[i]
	if el in rate:
		continue
	else:
		rate.add(el)
		ans.append(i + 1)
if len(ans) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(ans[i], end=' ')


from collections import Counter

def diverse_teams(nums, k):
	ctr = Counter(nums)
	if k <= len(ctr.keys()):
		print('YES')
		candidates = list(ctr.keys())[:k]
		for c in candidates:
			print(nums.index(c) + 1, end=' ')
	else:
		print('NO')
(n, k) = list(map(int, input().split()))
arr = list(map(int, input().split()))
diverse_teams(arr, k)


def diverseteam(a, b):
	s_b = set()
	l_pos = []
	for ind in range(len(b)):
		if b[ind] not in s_b:
			s_b.add(b[ind])
			l_pos.append(ind + 1)
	if len(s_b) >= a:
		print('YES')
		for res in range(a):
			print(l_pos[res], end=' ')
	else:
		print('NO')
nndk = [int(i) for i in input().split()]
ratings = [int(j) for j in input().split()]
diverseteam(nndk[1], ratings)


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
t = []
v = []
for i in range(n):
	if not a[i] in v:
		t.append(i + 1)
		v.append(a[i])
if len(t) >= k:
	ch = ''
	for i in range(k):
		ch = ch + str(t[i]) + ' '
	print('YES')
	print(ch[:-1])
else:
	print('NO')


from collections import defaultdict

def main():
	(n, k) = map(int, input().split())
	res = []
	used = set()
	a = list(map(int, input().split()))
	for (i, val) in enumerate(a):
		if val not in used:
			used.add(val)
			res.append(i + 1)
	if len(res) >= k:
		print('YES')
		print(*res[:k])
	else:
		print('NO')
main()


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
selected = []
index_selected = []
cnt = 0
for i in range(n):
	if a[i] not in selected:
		selected.append(a[i])
		index_selected.append(i)
		cnt += 1
if cnt >= k:
	print('YES')
	for i in range(k):
		print(index_selected[i] + 1, end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
l = map(int, input().split())
s = set()
r = []
for (i, m) in enumerate(l):
	if m not in s:
		s.add(m)
		r.append(i + 1)
if len(r) < k:
	print('NO')
else:
	print('YES')
	print(' '.join(map(str, r[:k])))


(n, k) = (int(i) for i in input().split())
r = [int(i) for i in input().split()]
pos = []
t = []
for i in range(n):
	if not r[i] in t:
		t.append(r[i])
		pos.append(i + 1)
		if len(t) == k:
			break
if len(t) == k:
	print('YES')
	for i in pos:
		print(i, end=' ')
else:
	print('NO')


(n, k) = [int(s) for s in input().split()]
used = [0] * 101
array = [int(s) for s in input().split()]
ans = []
counter = 0
for i in range(len(array)):
	if not used[array[i]] and counter < k:
		ans.append(i + 1)
		used[array[i]] = 1
		counter += 1
if len(ans) == k:
	print('YES')
	print(' '.join([str(s) for s in ans]))
else:
	print('NO')


line1 = list(map(int, input().strip().split()))
line2 = list(map(int, input().strip().split()))
n = line1[0]
k = line1[1]
distinct = []
distinct_position = []
for (i, rating) in enumerate(line2):
	if distinct.count(rating) == 0:
		distinct.append(rating)
		distinct_position.append(i + 1)
		if len(distinct) == k:
			break
if len(distinct) < k:
	print('NO')
else:
	print('YES')
	for position in distinct_position:
		print(position, end=' ')


s = input()
s = s.split()
n = int(s[0])
k = int(s[1])
s = input()
s = s.split()
a = {}
for i in range(n):
	kd = int(s[i])
	if kd not in a:
		a[kd] = i + 1
if len(a) < k:
	print('NO')
else:
	print('YES')
	i = 0
	for key in a.keys():
		if i == k:
			break
		print(a[key], end=' ')
		i += 1


(n, m) = map(int, input().split())
arr = list(map(int, input().split()))
d = []
ans = []
tmpm = m
while m > 0:
	for (i, v) in enumerate(arr):
		if not v in d:
			ans.append(i)
			d.append(v)
			break
	m -= 1
m = tmpm
if len(d) == m:
	print('YES')
	for i in ans:
		print(i + 1, end=' ')
else:
	print('NO')


(n, k) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
ans_i = []
ans = set()
i = 0
while k > 0 and i <= n - 1:
	if a[i] not in ans:
		ans.add(a[i])
		ans_i.append(i)
		k -= 1
	i += 1
if k > 0:
	print('NO')
else:
	print('YES')
	for i in ans_i:
		print(i + 1, end=' ')


(n, k) = map(int, input().split())
mas = list(map(int, input().split()))
num = []
for i in range(100):
	num.append(0)
i = 0
ans = []
count = 0
while i < n:
	if num[mas[i] - 1] == 0:
		num[mas[i] - 1] = 1
		ans.append(i + 1)
		i += 1
		count += 1
	else:
		i += 1
	if count == k:
		print('YES')
		print(*ans)
		exit()
print('NO')


(n, k) = map(int, input().split())
ls = list(map(int, input().split()))
resLs = []
ansLs = []
for i in range(n):
	if ls[i] not in resLs:
		resLs += [ls[i]]
		ansLs += [i + 1]
	if len(resLs) >= k:
		print('YES')
		print(*ansLs)
		break
else:
	print('NO')


(n, k) = map(int, input().split())
listo = list(map(int, input().split()))
(p, c) = ([], [])
for item in listo:
	if item not in c and len(p) != k:
		c.append(item)
		p.append(listo.index(item) + 1)
if len(p) != k:
	print('NO')
else:
	print('YES')
	print(*p)


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
li = []
c = 0
s = set(l)
le = len(s)
if k > le:
	print('NO')
else:
	print('YES')
	for i in range(1, len(l) + 1):
		if l[i - 1] not in li:
			li.append(l[i - 1])
			print(i, end=' ')
			c = c + 1
		if c == k:
			break


(n, k) = map(int, input().split())
students = input().split()
c = set()
ind = []
for i in range(0, len(students)):
	if students[i] not in c:
		c.add(students[i])
		ind.append(i + 1)
if len(ind) < k:
	print('NO')
else:
	print('YES')
	print(' '.join([str(i) for i in ind[0:k]]))


def diverse_team():
	students = input().split()
	grades = input().split()
	students = [int(i) for i in students]
	dic = {}
	temp = 0
	output = ''
	for i in range(len(grades)):
		if grades[i] not in dic:
			dic[grades[i]] = i + 1
			temp += 1
		if temp == students[1]:
			print('YES')
			for i in dic:
				if len(output) == 0:
					output = output + str(dic[i])
				else:
					output = output + ' ' + str(dic[i])
			print(output)
			return
	print('NO')
	return
diverse_team()


(N, K) = input().split()
(N, K) = (int(N), int(K))
A = [int(x) for x in input().split()]
seen = set()
ids = []
ok = False
for (i, a) in enumerate(A):
	if a in seen:
		continue
	ids.append(i + 1)
	seen.add(a)
	if len(ids) == K:
		ok = True
		break
if ok:
	print('YES')
	print(*ids)
else:
	print('NO')


(n, k) = map(int, input().split())
l = [int(i) for i in input().split()]
s = set()
o = []
i = 0
while i < len(l):
	if l[i] not in s:
		s.add(l[i])
		o.append(i + 1)
	if len(s) == k:
		break
	i += 1
if len(s) == k:
	print('YES')
	print(*o)
else:
	print('NO')


(n, k) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
answer = []
b = set(a)
if len(b) < k:
	print('NO')
else:
	print('YES')
	for i in range(len(a)):
		if a[i] in b:
			answer.append(i + 1)
			b.remove(a[i])
		if len(answer) == k:
			break
	print(*answer)


(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)


a = list(input().split(' '))
(n, k) = (int(a[0]), int(a[1]))
a = input().split(' ')
a = list((int(x) for x in a))
(res, ind) = (set(), [])
for i in range(len(a)):
	if a[i] not in res:
		res.add(a[i])
		ind.append(i)
	if len(res) == k:
		break
if len(res) < k:
	print('NO')
else:
	print('YES')
	for item in ind:
		print(item + 1, sep=' ', end=' ')


(n, m) = (int(i) for i in input().split())
ls = [int(i) for i in input().split()]
val = []
res = []
count = 0
for i in range(0, len(ls)):
	if ls[i] not in res:
		res.append(ls[i])
		val.append(i + 1)
		count += 1
		if count == m:
			break
if count == m:
	print('YES')
	print(*val, end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
A = list(map(int, input().split()))
raz = []
balls = set()
for z in range(n):
	if A[z] not in balls:
		balls.add(A[z])
		raz.append(str(z + 1))
if len(raz) < k:
	print('NO')
else:
	print('YES')
	print(' '.join(raz[:k]))


x = list(map(int, input().split()))
y = list(map(int, input().split()))
k = x[0]
p = 0
for i in range(x[0] - 1, -1, -1):
	if y.count(y[i]) > 1:
		y[i] = 0
		k -= 1
if k >= x[1]:
	print('YES')
	for i in range(x[0]):
		if y[i] != 0:
			print(i + 1, end=' ')
			p += 1
		if p == x[1]:
			break
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')


def Ans():
	N = input().split()
	A = input().split()
	ans = []
	b = []
	for i in range(int(N[0])):
		if A[i] not in ans:
			ans += [A[i]]
			b += [i]
		if len(ans) == int(N[1]):
			print('YES')
			for j in range(len(b)):
				if b != len(b) - 1:
					print(int(b[j]) + 1, end=' ')
				else:
					print(int(b[j]) + 1)
			break
	else:
		print('NO')
Ans()


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
if len(set(a)) < k:
	print('NO')
else:
	print('YES')
	cnt = 0
	i = 0
	d = [0] * 101
	while cnt != k:
		if d[a[i]] == 0:
			print(i + 1, end=' ')
			cnt += 1
		d[a[i]] += 1
		i += 1


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


(n, m) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
s = set(a)
l = len(s)
if l < m:
	print('NO')
else:
	print('YES')
	k = []
	c = 0
	for i in range(n):
		if a[i] not in k:
			k.append(a[i])
			print(i + 1, end=' ')
			c += 1
			if c == m:
				break
	print()


import sys
import math
import bisect

def main():
	(n, k) = map(int, input().split())
	A = list(map(int, input().split()))
	d = dict()
	for i in range(n):
		if A[i] not in d:
			d[A[i]] = i
	if len(d) < k:
		print('NO')
	else:
		print('YES')
		B = list(d.values())
		print(' '.join(list((str(a + 1) for a in B[:k]))))
main()


yoar = list(map(int, input().split()))
n = yoar[0]
k = yoar[1]
arr = list(map(int, input().split()))
ans = []
yoar = []
for i in range(n):
	if arr[i] not in yoar:
		yoar.append(arr[i])
		ans.append(i)
if len(ans) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(ans[i] + 1, end=' ')
	print()


fir = input()
first = fir.split(' ')
sec = input()
first = fir.split(' ')
second = sec.split(' ')
index = 0
people = list()
num = list()
while index < len(second):
	if second[index] in people:
		index += 1
	else:
		people.append(second[index])
		num.append(index + 1)
		index += 1
if len(people) < int(first[1]):
	print('NO')
else:
	index = 0
	yes = ''
	while index < int(first[1]):
		yes += str(num[index]) + ' '
		index += 1
	print('YES')
	print(yes)


def inline():
	return [int(e) for e in input().split()]

def outline(l):
	for e in l:
		print(e, end=' ')
f = inline()
n = f[0]
k = f[1]
pupils = inline()
s = set(pupils)
if len(s) >= k:
	print('YES')
	found = set()
	output = list()
	for i in range(0, n):
		if len(found) >= k:
			break
		if pupils[i] not in found:
			output.append(i + 1)
			found.add(pupils[i])
	outline(output)
else:
	print('NO')


p = input()
p = p.split()
n = int(p[0])
k = int(p[1])
q = input()
q = q.split()
ratings = []
chinky = []
for x in range(0, n):
	a = int(q[x])
	ratings = ratings + [a]
	chinky = chinky + [a]
ratings.sort()
i = 1
for x in range(n - 1):
	if ratings[x] != ratings[x + 1]:
		i = i + 1
if i >= k:
	print('YES')
else:
	print('NO')
b = []
c = []
d = [1, 15, 16, 13]
if i >= k:
	for x in range(n):
		for y in range(x + 1, n):
			if chinky[x] == chinky[y]:
				b = b + [y]
			if x in b:
				break
			if x not in c:
				c = c + [x]
	if n - 1 not in b:
		c = c + [x]
if i >= k:
	for x in range(k):
		print(c[x] + 1, end=' ')


(n, k) = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
rates = []
ids = []
for i in range(0, len(l)):
	if l[i] not in rates:
		rates.append(l[i])
		ids.append(i + 1)
	if len(ids) == k:
		break
if len(ids) == k:
	print('YES')
	print(*ids)
else:
	print('NO')


entrada = input().split(' ')
arr = input().split(' ')
n = int(entrada[0])
k = int(entrada[1])
set_arr = set(arr)
if len(set_arr) < k:
	print('NO')
else:
	result = []
	print('YES')
	for i in set_arr:
		result.append(arr.index(i) + 1)
	result = sorted(result)
	for i in range(k):
		print(result[i], end=' ')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
d = {}
arr = []
count = 0
for i in range(n):
	if a[i] in d or count >= k:
		continue
	d[a[i]] = 1
	arr.append(i + 1)
	count += 1
if count < k:
	print('NO')
else:
	print('YES')
	print(*arr)


(n, k) = map(int, input().split())
ar = list(map(int, input().split()))
maps = {}
for i in range(len(ar)):
	a = ar[i]
	if a not in maps:
		maps[a] = i + 1
	if len(maps) == k:
		break
if len(maps) == k:
	print('YES')
	for m in maps:
		print(maps[m], end=' ')
else:
	print('NO')


(n, k) = list(map(int, input().strip().split()))
a = list(map(int, input().strip().split()))
d = list(set(a))
res = []
if len(d) < k:
	print('NO')
else:
	print('YES')
	for i in range(n):
		if a[i] in d:
			if len(res) < k:
				res.append(str(i + 1))
				d.remove(a[i])
	print(' '.join(res))


nk = input().split()
k = int(nk[1])
students = input().split()
unique = []
unique_index = []
flag = False
for i in range(int(nk[0])):
	if not students[i] in unique:
		unique.append(students[i])
		unique_index.append(str(i + 1))
	if len(unique_index) >= k:
		flag = True
		break
if flag:
	print('YES')
	print(' '.join(unique_index))
else:
	print('NO')


(n, k) = list(map(int, input().split()))
data = list(map(int, input().split()))
ans = set()
idxs = [[0] for i in range(k)]
idx = 0
for i in range(n):
	x = data[i]
	if x not in ans and idx < k:
		idxs[idx] = i
		idx += 1
		ans.add(x)
if idx == k:
	print('YES')
	for x in idxs:
		print(x + 1, end=' ')
	print()
else:
	print('NO')


(n, k) = [int(x) for x in input().split()]
s = [int(x) for x in input().split()]
q = []
a = []
for i in range(n):
	if s[i] not in q:
		q.append(s[i])
		a.append(i + 1)
		if len(a) == k:
			print('YES')
			print(*a)
			exit()
print('NO')


(n, k) = map(int, input().split())
m = list(map(int, input().split()))
h = set(m)
if len(h) < k:
	print('NO')
else:
	be = []
	ans = []
	for i in range(n):
		if not m[i] in be and k != 0:
			ans.append(i + 1)
			be.append(m[i])
			k -= 1
	print('YES')
	print(' '.join(map(str, ans)))


(n, k) = [int(x) for x in input().split()]
arr = list(map(int, input().split()))
a = set(arr)
if len(a) < k:
	print('NO')
else:
	print('YES')
	var = 0
	for i in range(n):
		if arr[i] in a and var < k:
			print(i + 1, end=' ')
			var += 1
			a.remove(arr[i])
	print()


from collections import defaultdict

def compute(n, k, arr):
	dic = defaultdict(lambda : 0)
	temp = []
	for i in range(n):
		if dic[arr[i]] == 0:
			temp.append(i + 1)
		dic[arr[i]] = 1
	if len(dic) >= k:
		print('YES')
		for i in range(k):
			print(temp[i], end=' ')
	else:
		print('NO')
(n, k) = map(int, input().split())
arr = list(map(int, input().split()))
compute(n, k, arr)


(a, b) = map(int, input().split())
ar = [int(s) for s in input().split()]
arr = []
kek = []
s = 0
for i in range(len(ar)):
	if arr.count(ar[i]) == 0:
		arr.append(ar[i])
		s += 1
		kek.append(i + 1)
if len(arr) >= b:
	print('YES')
	print(*kek[:b])
else:
	print('NO')


(n, k) = input().split()
(n, k) = [int(n), int(k)]
rating = input().split()
rating = [int(x) for x in rating]
selected = list()
index = list()
p = 0
for i in range(0, n):
	if rating[i] not in selected and p < k:
		selected.append(rating[i])
		index.append(i)
		p = p + 1
if p is k:
	print('YES')
	for i in range(0, k):
		print(index[i] + 1, end=' ')
else:
	print('NO', end='')


[n, k] = list(map(int, input().split()))
B = list(map(int, input().split()))
l = len(B)
sol = []
k2 = 0
poids = []
i = 0
while i < l and k2 < k:
	if B[i] not in poids:
		sol.append(str(i + 1))
		poids.append(B[i])
		k2 += 1
	i += 1
if k2 == k:
	print('YES')
	string = ' '.join(sol)
	print(string)
else:
	print('NO')


tudo1 = input().split()
tudo2 = input().split()
a = int(tudo1[0])
b = int(tudo1[1])
opa = False
for i in range(0, len(tudo2)):
	l = [tudo2[i]]
	k = [i + 1]
	for j in range(0, len(tudo2)):
		if tudo2[j] not in l and j != i:
			l.append(tudo2[j])
			k.append(j + 1)
		if len(l) == b:
			print('YES')
			opa = True
			print(k[0], end='')
			for r in range(1, len(k)):
				print(' {}'.format(k[r]), end='')
			print('')
			break
	if opa:
		break
if opa == False:
	print('NO')


x = list(map(int, input().split()))
y = list(map(int, input().split()))
w = []
for i in range(x[0]):
	if y[i] not in w:
		w.append(y[i])
if len(w) >= x[1]:
	print('YES')
	for i in range(x[1]):
		for j in range(x[0]):
			if w[i] == y[j]:
				print(str(j + 1) + ' ', end='')
				break
	print('')
else:
	print('NO')


(n, m) = list(map(int, input().strip().split()))
l = list(map(int, input().strip().split()))
t = []
p = []
for i in l:
	if i in p:
		pass
	else:
		p += [i]
		t += [l.index(i) + 1]
if len(t) >= m:
	print('YES')
	for i in range(m):
		print(t[i], end=' ')
	print()
else:
	print('NO')


(n, k) = [int(x) for x in input().strip().split(' ')]
a = [int(x) for x in input().strip().split(' ')]
visited = set([])
r = []
for (i, x) in enumerate(a):
	if x in visited:
		continue
	r.append(i + 1)
	visited.add(x)
	if len(r) == k:
		break
if len(r) == k:
	print('YES')
	print(' '.join([str(x) for x in r]))
else:
	print('NO')


(a, b) = map(int, input().split())
s = input()
n = [int(s) for s in s.split()]
r = []
l = []
for i in range(a):
	if n[i] not in r:
		r.append(n[i])
		l.append(i + 1)
if len(l) == b:
	print('YES')
	print(' '.join([str(i) for i in l]))
elif len(l) > b:
	while len(l) > b:
		l.pop()
	print('YES')
	print(' '.join([str(i) for i in l]))
else:
	print('NO')


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
c = 0
d = []
w = []
for i in range(n):
	if l[i] not in d:
		d.append(l[i])
		w.append(i + 1)
		c = c + 1
	if c == k:
		print('YES')
		print(*w)
		break
else:
	print('NO')


from collections import Counter
(n, k) = list(map(int, input().split()))
a = list(map(int, input().split()))
b = dict(Counter(a))
if len(b) < k:
	print('NO')
else:
	c = []
	for i in range(n):
		if a[i] in b:
			c.append(i + 1)
			del b[a[i]]
	c = c[:k]
	print('YES')
	print(*c)


(n, k) = map(int, input().split())
list1 = [int(x) for x in input().split()]
list2 = []
indexList = []
for i in range(len(list1)):
	if list1[i] not in list2:
		list2.append(list1[i])
		indexList.append(i + 1)
if len(indexList) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(indexList[i], end=' ')
	print()


import sys
i1 = input().split(' ')
rating = input().split(' ')
n = int(i1[0])
k = int(i1[1])
s = set()
a = []
c = 0
s1 = ''
gotit = 0
for i in range(len(rating)):
	rate = int(rating[i])
	if rate not in s:
		s.add(rate)
		a.append(str(i + 1))
		c = c + 1
		if k == c:
			print('YES')
			print(' '.join(a))
			gotit = 1
if gotit == 0:
	print('NO')


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


def f(n, k, candidates):
	output = []
	members = []
	numberOfMembers = 0
	for i in range(n):
		if candidates[i] not in members:
			output.append(i + 1)
			members.append(candidates[i])
			numberOfMembers += 1
			if numberOfMembers == k:
				return output
	return False
(n, k) = map(int, input().split())
candidates = [int(x) for x in input().split()]
x = f(n, k, candidates)
if x == False:
	print('NO')
else:
	print('YES')
	print(' '.join(map(str, x)))


(n, k) = map(int, input().split(' '))
arr = list(map(int, input().split(' ')))
team = []
for i in range(n):
	t = 1
	for j in team:
		if arr[i] == arr[j - 1]:
			t = 0
			break
	if t == 1:
		team.append(i + 1)
	if len(team) == k:
		print('YES')
		for l in team:
			print(l, end=' ')
		break
if len(team) < k:
	print('NO')


(n, k) = map(int, input().split())
ratings = list(map(int, input().split()))
c = set()
l = []
for i in range(n):
	if ratings[i] not in c:
		c.add(ratings[i])
		l.append(i + 1)
if len(l) >= k:
	print('YES')
	out = ''
	out += str(l[0])
	for i in range(1, k):
		out += ' ' + str(l[i])
	print(out)
else:
	print('NO')


(n, k) = map(int, input().split())
A = list(map(int, input().split()))
used = set()
ans = []
for (i, a) in enumerate(A):
	if a not in used:
		ans.append(i + 1)
		used.add(a)
if len(ans) >= k:
	print('YES')
	print(*ans[0:k])
else:
	print('NO')


def diverse_team():
	(n, k) = map(int, input().split())
	stu = input().split()
	reslt = []
	memo = []
	for i in range(len(stu)):
		if stu[i] not in reslt:
			memo.append(str(i + 1))
			reslt.append(stu[i])
	if len(reslt) < k:
		print('NO')
		return
	else:
		print('YES')
		print(' '.join(memo[:k]))
		return
diverse_team()


str_input1 = input()
str_input2 = input()
input_arr1 = str_input1.split()
kol_vkomande = int(input_arr1[1])
num_shkolnik = str_input2.split()
act_num = 1
counter = 0
vkomande = []
num_in_kom = []
for i in num_shkolnik:
	if i not in vkomande and counter < kol_vkomande:
		vkomande.append(i)
		num_in_kom.append(act_num)
		counter += 1
	act_num += 1
if len(num_in_kom) == 0 or counter < kol_vkomande:
	print('NO')
else:
	print('YES')
	for k in num_in_kom:
		print(k, end=' ')


(n, k) = [int(x) for x in input().split()]
s = [int(x) for x in input().split()]
seen = set()
count = 0
nums = []
for i in range(n):
	if s[i] not in seen:
		nums.append(i + 1)
		seen.add(s[i])
		count += 1
if count >= k:
	print('YES')
	for i in range(k):
		print(nums[i], end=' ')
else:
	print('NO')


s = input().split()
(n, m) = (int(s[0]), int(s[1]))
cl = list(map(int, input().split()))
norm = []
block = []
for x in range(n):
	if cl[x] not in block:
		block.append(cl[x])
		norm.append(x + 1)
k = len(norm)
if m > k:
	print('NO')
else:
	print('YES')
	print(*norm[:m])


(n, x) = map(int, input().split())
ind = 1
a = []
b = []
for i in input().split():
	if i not in a:
		a += [i]
		b += [ind]
	ind += 1
if len(a) >= x:
	print('YES')
	print(*b[:x])
else:
	print('NO')


(a, b) = map(int, input().split())
l = list(map(int, input().split()))
k = []
m = []
for i in range(a):
	if l[i] in k:
		pass
	else:
		k.append(l[i])
		m.append(i)
if len(m) >= b:
	print('YES')
	for p in range(b):
		print(m[p] + 1, end=' ')
else:
	print('NO')


(n, k) = list(map(int, input().split()))
werte = list(map(int, input().split()))
no_doubles = []
indeces = []
for i in range(n):
	if werte[i] in no_doubles:
		continue
	no_doubles.append(werte[i])
	indeces.append(i + 1)
if len(no_doubles) >= k:
	print('YES')
	print(*indeces[0:k])
else:
	print('NO')


(n, k) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
f = []
ii = []
for (i, v) in enumerate(l):
	if v not in f:
		f.append(v)
		ii.append(str(i + 1))
if len(ii) >= k:
	print('YES')
	print(' '.join(ii[:k]))
else:
	print('NO')


lissta = list(map(int, input().split()))
resp = ''
s = list(map(int, input().split()))
l1 = list()
l2 = list()
for i in range(len(s)):
	if s[i] not in l1:
		l1.append(s[i])
		l2.append(i)
if len(l1) >= lissta[1]:
	print('YES')
	for i in range(lissta[1]):
		resp += str(l2[i] + 1) + ' '
	print(resp)
else:
	print('NO')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
l = len(a)
i = 0
s = set()
res = []
while len(s) < k and i < l:
	if a[i] not in s:
		res.append(i + 1)
		s.add(a[i])
	i += 1
if len(s) == k:
	print('YES')
	print(*res)
else:
	print('NO')


inp = input()
data = {'tokens': None, 'i': 0}
data['tokens'] = inp.split()

def get_token():
	if data['i'] == len(data['tokens']):
		data['tokens'] = input().split()
		data['i'] = 0
	token = data['tokens'][data['i']]
	data['i'] += 1
	return token

def get_int():
	return int(get_token())
n = get_int()
k = get_int()
rank = []
team = []
for i in range(n):
	rank.append(get_int())
for i in range(n):
	if rank[i] in team:
		continue
	else:
		team.append(rank[i])
		if len(team) == k:
			break
if len(team) == k:
	print('YES')
	for x in team:
		y = rank.index(x) + 1
		print(y, end=' ')
else:
	print('NO')


import sys

def suggest_team(n, k, ratings):
	different_scores = {}
	team_members = []
	for i in range(n):
		if len(team_members) == k:
			return ('YES', team_members)
		if different_scores.get(ratings[i], True):
			different_scores[ratings[i]] = False
			team_members.append(i + 1)
	if len(team_members) == k:
		return (True, team_members)
	else:
		return (False, [])
(n, k) = map(int, sys.stdin.readline().split())
ratings = list(map(int, sys.stdin.readline().split()))
(out, team) = suggest_team(n, k, ratings)
if out:
	print('YES')
	print(*team)
else:
	print('NO')


(n, k) = map(int, input().split())
d = [int(el) for el in input().split()]
b = set()
a = []
for i in range(n):
	if not d[i] in b:
		b.add(d[i])
		a.append([d[i], i])
if len(b) < k:
	print('NO')
else:
	print('YES')
	for i in range(k):
		print(a[i][1] + 1, end=' ')


(n, k) = map(int, input().split())
students = list(map(int, input().split()))
count = 0
indices = []
flag = 1
nova = []
for i in students:
	if i not in nova:
		count += 1
		indices.append(flag)
		nova.append(i)
		if count == k:
			break
	flag += 1
if count >= k:
	print('YES')
	for i in indices:
		print(i, end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
d = {}
for i in l:
	if i in d:
		d[i] += 1
	else:
		d[i] = 1
if len(d) < k:
	print('NO')
else:
	print('YES')
	d1 = {}
	c = 0
	for i in range(n):
		if c < k and l[i] not in d1:
			c += 1
			print(i + 1, end=' ')
			d1[l[i]] = 1


def sol():
	(n, k) = map(int, input().split())
	A = [int(item) for item in input().split()]
	mySet = []
	indexSet = []
	for i in range(n):
		if A[i] not in mySet:
			mySet.append(A[i])
			indexSet.append(i)
	if len(mySet) < k:
		print('NO')
	else:
		print('YES')
		for i in range(k - 1):
			print(indexSet[i] + 1, end=' ')
		print(indexSet[k - 1] + 1)
sol()


from collections import Counter
(x, y) = map(int, input().split())
l = list(map(int, input().split()))
c = Counter(l)
if len(c) >= y:
	a = []
	print('YES')
	m = 0
	for i in c.keys():
		if m > y - 1:
			break
		a.append(l.index(i) + 1)
		m = m + 1
	print(*a)
else:
	print('NO')


(n, k) = map(int, input().split())
a = [0] * 101
l = list(map(int, input().split()))
if len(set(l)) < k:
	print('NO')
else:
	vi = set()
	i = 0
	ans = []
	while k:
		if l[i] not in vi:
			vi.add(l[i])
			ans.append(i + 1)
			k -= 1
		i += 1
	print('YES')
	print(*ans)


num_tam = input()
time = input()
lista_num_tam = num_tam.split(' ')
tam = int(lista_num_tam[1])
lista_time = time.split(' ')
lista_unica = []
for i in lista_time:
	if i not in lista_unica:
		lista_unica.append(i)
resultados = []
if len(lista_unica) >= tam:
	print('YES')
	for i in lista_unica:
		resultados.append(lista_time.index(i) + 1)
	print(*resultados[:tam])
else:
	print('NO')


(n_students, len_team) = [int(i) for i in input().split()]
students = [int(i) for i in input().split()]
diverse_team = {}
possible = False
for i in range(len(students)):
	if students[i] not in diverse_team:
		diverse_team[students[i]] = i
	if len(diverse_team) == len_team:
		possible = True
		break
if possible:
	print('YES')
	for i in diverse_team.values():
		print(i + 1, end=' ')
else:
	print('NO')


(n, k) = list(map(int, input().split(' ')))
a = list(map(int, input().split(' ')))
answer = []
unique = []
i = 0
for v in a:
	if v not in unique:
		unique.append(v)
		answer.append(i + 1)
	i += 1
if len(unique) >= k:
	print('YES')
	print(*answer[0:k])
else:
	print('NO')


nk = list(map(int, input().split()))
a = list(map(int, input().split()))
g = []
i = 0
while len(g) < nk[1] and i < len(a):
	if a[i] not in g:
		g.append(a[i])
	i = i + 1
if len(g) == nk[1]:
	print('YES')
	s = ''
	for j in g:
		s = s + str(a.index(j) + 1) + ' '
	print(s[:-1])
else:
	print('NO')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
sa = set(a)
if len(sa) >= k:
	print('YES')
	ans = []
	seen = [False] * (max(a) + 1)
	for i in range(n):
		if seen[a[i]]:
			continue
		else:
			ans.append(i + 1)
			seen[a[i]] = True
		if len(ans) == k:
			break
	print(*ans)
else:
	print('NO')


memberNow = 0
sameRank = False
teamMember = []
(studentNum, teamCons) = map(int, input().split())
allRanks = [int(x) for x in input().split()]
for i in range(studentNum):
	if i == 0:
		teamMember.append(i + 1)
		memberNow = memberNow + 1
	else:
		if memberNow == teamCons:
			break
		for j in range(i):
			if allRanks[i] == allRanks[j]:
				sameRank = True
				break
		if sameRank == False:
			teamMember.append(i + 1)
			memberNow = memberNow + 1
		else:
			sameRank = False
if memberNow >= teamCons:
	print('YES')
	print(' '.join((str(student) for student in teamMember)))
else:
	print('NO')


(a, b) = map(int, input().split())
l = list(map(int, input().split()))
l1 = []
l2 = []
for i in range(a):
	if l[i] not in l1:
		l1.append(l[i])
		l2.append(i + 1)
if len(l2) < b:
	print('NO')
else:
	print('YES')
	for i in range(b):
		print(l2[i], end=' ')


from bisect import bisect_left, bisect_right
(n, k) = map(int, input().split())
a = list(map(int, input().split()))
ans = []
b = []
yes = False
for i in range(n):
	if a[i] not in b:
		ans.append(i + 1)
		b.append(a[i])
	if len(b) == k:
		yes = True
		break
if yes:
	print('YES')
	print(*ans)
else:
	print('NO')


(n, k) = list(map(int, input().split()))
a = list(map(int, input().split()))
dic = {}
for (i, j) in enumerate(a):
	if str(j) not in dic:
		dic[str(j)] = i + 1
if len(dic) >= k:
	print('YES')
	t = k
	for (x, y) in dic.items():
		print(y, end=' ')
		t -= 1
		if t == 0:
			break
else:
	print('NO')


(n, k) = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
for i in range(0, len(l) - 1):
	for j in range(i + 1, len(l)):
		if l[j] != 0 and l[i] == l[j]:
			l[j] = 0
count = 0
for i in range(len(l)):
	if l[i] != 0:
		count += 1
if count >= k:
	temp = 0
	print('YES')
	for i in range(0, len(l)):
		if l[i] != 0:
			print(i + 1, end=' ')
			temp += 1
		if temp == k:
			break
else:
	print('NO')


(n, k) = [int(x) for x in input().split()]
li = [int(x) for x in input().split()]
check = []
ans = ''
if len(set(li)) < k:
	print('NO')
	exit()
else:
	count = 0
	for i in li:
		if i not in check and count < k:
			ans += str(li.index(i) + 1) + ' '
			check.append(i)
			count += 1
print('YES')
ans = ans[:-1]
print(ans)


(N, K) = map(int, input().split())
A = list(map(int, input().split()))
B = []
C = []
for i in range(0, N):
	if B.count(A[i]) == 0:
		B.append(A[i])
		C.append(i + 1)
if len(C) >= K:
	print('YES')
	print(*C[:K])
else:
	print('NO')


(m, n) = map(int, input().split())
stu = list(map(int, input().split()))
t = list(set(stu))
final = []
flag = 1
count = 0
for i in range(len(stu)):
	if stu[i] in t and stu.index(stu[i]) + 1 not in final:
		final.append(stu.index(stu[i]) + 1)
		count += 1
	if count == n:
		flag = 0
		break
if flag == 0:
	print('YES')
	for i in final:
		print(i, end=' ')
else:
	print('NO')


(n, k) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b = []
idx = []
for i in range(len(a)):
	if a[i] not in b:
		b += [a[i]]
		idx += [i + 1]
if k <= len(b):
	print('YES')
	for i in range(len(idx)):
		print(idx[i], end=' ')
		if i == k - 1:
			break
else:
	print('NO')


d = input().split()
m = int(d[0])
n = int(d[1])
a = input().split()
k = len(a)
lst = []
i = 0
if k == m:
	for x in a:
		if x not in lst:
			lst.append(x)
r = len(lst)
if r >= n:
	print('YES')
	for i in range(n):
		v = a.index(lst[i])
		print(v + 1, end=' ')
else:
	print('NO')


(n, k) = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
s = ['1']
sx = [l[0]]
c = 1
if len(set(l)) < k:
	print('NO')
else:
	for i in range(1, n):
		if c == k:
			break
		if l[i] not in sx:
			s.append(str(i + 1))
			sx.append(l[i])
			c += 1
	if c == k:
		print('YES')
		print(' '.join(s))
	else:
		print('NO')


(n, k) = list(map(int, input().split()))
a = list(map(int, input().split()))
team = []
used = [False for _ in range(101)]
for i in range(n):
	if not used[a[i]]:
		team.append(i + 1)
	used[a[i]] = True
if len(team) < k:
	print('NO')
else:
	print('YES')
	print(' '.join([str(x) for x in team[:k]]))


(n, k) = input().split(' ')
k = int(k)
x = list(map(int, input().split(' ')))
t = []
H = []
for i in x:
	if i not in t:
		t.append(i)
for each in t:
	H += [x.index(each) + 1]
if len(t) >= k:
	print('YES')
	for f in range(0, k):
		print(H[f], end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
arr = list(map(int, input().split()))
ans = []
ans_ind = []
for i in range(len(arr)):
	if arr[i] not in ans:
		ans.append(arr[i])
		ans_ind.append(i + 1)
	if len(ans) >= k:
		print('YES')
		for i in ans_ind:
			print(i, end=' ')
		print()
		exit()
print('NO')


import sys
(n, k) = map(int, input().split())
input_list = list(map(int, input().split()))
y = []
z = []
i = 0
for x in input_list:
	if x not in y:
		y.append(x)
		z.append(i + 1)
	i += 1
if len(z) >= k:
	print('YES')
	for i in range(k):
		print(z[i], end=' ')
else:
	print('NO')


(k, n) = map(int, input().split())
b = list(map(int, input().split()))
l = []
u = []
for i in range(len(b)):
	if b[i] not in u:
		u.append(b[i])
		l.append(i + 1)
if len(l) >= n:
	print('YES')
	for i in range(n):
		print(l[i], end=' ')
else:
	print('NO')


def main():
	(n, k) = list(map(int, input().split(' ')))
	check = list(map(int, input().split(' ')))
	indexes = []
	unique = []
	for i in range(n):
		if check[i] not in unique:
			unique.append(check[i])
			indexes.append(i + 1)
		if len(indexes) == k:
			print('YES')
			print(*indexes)
			return
	print('NO')
main()


(n, k) = list(map(int, input().strip().split(' ')))
nums = list(map(int, input().strip().split(' ')))
num_flag = {}
indexs = []
for (i, num) in enumerate(nums):
	if num in num_flag.keys():
		continue
	else:
		indexs.append(str(i + 1))
		num_flag[num] = 1
if len(num_flag.keys()) >= k:
	print('YES')
	print(' '.join(indexs[:k]))
else:
	print('NO')


A = [int(i) for i in input().split()]
n = A[0]
k = A[1]
B = [int(i) for i in input().split()]
S = set()
C = []
for i in range(len(B)):
	if B[i] not in S:
		S.add(B[i])
		C.append(i)
if len(C) >= k:
	print('YES')
	for i in range(k):
		print(C[i] + 1, end=' ')
else:
	print('NO')


__file__ = __file__.startswith('/home/a_farazei')

def input_():
	global __file__
	if not __file__:
		return input()
	if not hasattr(__file__, 'readline'):
		__file__ = open('input.txt', 'r')
	return __file__.readline()
(n, k) = map(int, input_().split())
arr = list(map(int, input_().split()))
if len(set(arr)) < k:
	print('NO')
else:
	print('YES')
	s = set()
	for (i, x) in enumerate(arr):
		if x not in s:
			print(str(i + 1) + ' ', end='')
			s.add(x)
		if len(s) >= k:
			break
	print()


(n, k) = map(int, input().split())
arr = [int(x) for x in input().split()]
soln = []
brr = arr
s = set(arr)
for i in range(0, len(arr)):
	lol = arr[i]
	for lol in s:
		soln.append(brr.index(lol) + 1)
		s.remove(lol)
		break
soln.sort()
if len(soln) < k:
	print('NO')
else:
	while len(soln) > k:
		soln.pop(-1)
	print('YES')
	print(*soln)


from sys import stdin, stdout
from collections import defaultdict
for _ in range(1):
	(n, k) = list(map(int, stdin.readline().split()))
	a = list(map(int, stdin.readline().split()))
	g = defaultdict(list)
	for i in range(n):
		g[a[i]] += [i]
	if len(g) < k:
		print('NO')
	else:
		print('YES')
		ans = []
		ks = list(g.keys())
		for val in ks[:k]:
			ans += [g[val][0] + 1]
		print(*ans)


import re
import math
import decimal
import bisect

def read():
	return input().strip()

def iread():
	return int(input().strip())

def viread():
	return [int(x) for x in input().strip().split()]
(n, k) = viread()
stus = set()
ratings = viread()
lst = []
for i in range(n):
	idx = i + 1
	rate = ratings[i]
	if rate not in stus:
		lst.append(idx)
		stus.add(rate)
if len(lst) >= k:
	print('YES')
	print(*lst[:k])
else:
	print('NO')


(n, m) = map(int, input().split())
arr = [int(x) for x in input().split()]
counter = {}
for i in arr:
	if i not in counter and len(counter) < m:
		counter[i] = arr.index(i) + 1
if len(counter) < m:
	print('NO')
else:
	print('YES')
	for i in counter:
		print(counter[i], end=' ')


(n, k) = map(int, input().split())
r = list(input().split())
s = [1]
X = {r[0]}
if k == 1:
	print('YES')
	print(1)
	exit(0)
for i in range(1, n):
	if r[i] not in X:
		s.append(i + 1)
		X.add(r[i])
		if len(s) == k:
			print('YES')
			for st in s:
				print(st, end=' ')
			exit(0)
print('NO')


(n, k) = map(int, input().split())
u = list(map(int, input().split()))
s = set()
d = set()
ans = 'NO'
p = 0
for i in range(n):
	if not u[i] in s:
		s.add(u[i])
		d.add(i + 1)
		p += 1
	if p == k:
		ans = 'YES'
		break
print(ans)
if p == k:
	d = list(d)
	for i in d:
		print(i, end=' ')


(n, k) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
f = [True] * 101
ans = []
for i in range(len(a)):
	if f[a[i]]:
		ans.append(i + 1)
		f[a[i]] = False
	if len(ans) == k:
		print('YES')
		for j in ans:
			print(j, end=' ')
		print()
		quit()
print('NO')


(n, k) = map(int, input().split())
a = input().split()
no_doubles = []
indices = []
for i in range(n):
	if a[i] not in no_doubles:
		no_doubles += [a[i]]
		indices += [i + 1]
		if len(no_doubles) == k:
			print('YES')
			print(*indices)
			quit()
print('NO')


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


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
c = []
if len(set(a)) < k:
	print('NO')
else:
	print('YES')
	i = 0
	while i != len(a) and len(c) != k:
		if a[i] not in c:
			c.append(a[i])
		i += 1
	print(' '.join(list(map(lambda x: str(a.index(x) + 1), c))))


import collections

def solve(A, N, K):
	visited = collections.defaultdict(bool)
	if len(set(A)) < K:
		print('NO')
		return
	else:
		res = []
		for i in range(N):
			if visited[A[i]] == False:
				visited[A[i]] = True
				res.append(i + 1)
			if len(res) == K:
				print('YES')
				print(*res)
				return
(n, k) = map(int, input().split())
A = list(map(int, input().split()))
solve(A, n, k)


def main():
	(n, k) = list(map(int, input().split()))
	a = set()
	b = list()
	i = 0
	for elem in list(map(int, input().split())):
		if elem not in a:
			a.add(elem)
			b.append(i + 1)
		i += 1
	if len(b) < k:
		print('NO')
	else:
		print('YES')
		for i in range(k):
			print(b[i], end=' ')
main()


(n, k) = map(int, input().split())
students = list(map(int, input().split()))
ratings = [False for i in range(101)]
group = []
for i in range(0, n):
	if not ratings[students[i]]:
		ratings[students[i]] = True
		group.append(i + 1)
	if len(group) == k:
		print('YES')
		for j in range(0, k):
			print(group[j], end=' ')
		break
if len(group) < k:
	print('NO')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
nonEqual = []
nonEqualIndexes = []
for i in range(n):
	if a[i] not in nonEqual:
		nonEqual.append(a[i])
		nonEqualIndexes.append(i + 1)
if len(nonEqualIndexes) >= k:
	print('YES')
	for i in nonEqualIndexes[:k]:
		print(i, end=' ')
else:
	print('NO')


(n, k) = [int(x) for x in input().split()]
L = [int(x) for x in input().split()]
D = {}
for i in range(0, n):
	if not L[i] in D:
		D[L[i]] = i + 1
if len(D) >= k:
	print('YES')
	count = 0
	for i in D.values():
		if count <= k - 1:
			print(i, end=' ')
			count += 1
else:
	print('NO')


(n, k) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
res = []
for i in range(n):
	if a[i] not in res:
		res.append(a[i])
c = 0
if len(res) < k:
	print('NO')
elif len(res) >= k:
	print('YES')
	for i in range(len(res)):
		if res[i] in a and c != k:
			print(a.index(res[i]) + 1, end=' ')
			c += 1
		if c == k:
			break


(n, k) = map(int, input().split())
x = list(map(int, input().split()))
l = []
ans = []
flag = 0
for i in range(n):
	if not x[i] in l:
		l.append(x[i])
		ans.append(i + 1)
	if len(l) == k:
		flag = 1
		break
if flag == 0:
	print('NO')
else:
	s = ''
	for k in range(len(ans)):
		if k != len(ans) - 1:
			s = s + str(ans[k]) + ' '
		else:
			s = s + str(ans[k])
	print('YES')
	print(s)


(s, t) = input().split()
rating = input().split()
team = []
teamin = ''
for i in range(int(s)):
	if len(team) == int(t):
		break
	elif rating[i] not in team:
		teamin += ' {}'.format(i + 1)
		team.append(rating[i])
if len(team) == int(t):
	print('YES')
	print(teamin.strip())
else:
	print('NO')


(m, n) = input().split()
(m, n) = (int(m), int(n))
lst = input().split()
n_lst = []
n_lst.append(lst[0])
n_lst1 = [1]
for i in range(1, len(lst)):
	if lst[i] not in n_lst:
		n_lst.append(lst[i])
		n_lst1.append(i + 1)
if len(n_lst1) >= n:
	print('YES')
	for i in range(n):
		print(n_lst1[i], end=' ')
else:
	print('NO')


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


import sys
from collections import defaultdict

def main(args):
	(n, k) = map(int, input().split())
	ar = list(map(int, input().split()))
	freq = defaultdict(list)
	for (i, val) in enumerate(ar, start=1):
		freq[val].append(i)
	if len(freq) < k:
		return print('NO')
	print('YES')
	teams = [pos[0] for pos in list(freq.values())][:k]
	print(' '.join((str(idx) for idx in teams)))
sys.exit(main(sys.argv))


(N, K) = map(int, input().split())
Rating = list(map(int, input().split()))
RatingSet = set(Rating)
result = []
resultIndex = []
if len(RatingSet) < K:
	print('NO')
else:
	print('YES')
	result.append(Rating[0])
	resultIndex.append(1)
	for i in range(N):
		Flag = 'y'
		length = len(result)
		for j in range(length):
			if Rating[i] == result[j]:
				Flag = 'n'
		if Flag == 'y':
			resultIndex.append(i + 1)
			result.append(Rating[i])
	for k in range(K):
		print(resultIndex[k], end=' ')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
s = []
b = []
for i in range(n):
	if a[i] in s:
		continue
	else:
		s.append(a[i])
		b.append(i)
	if len(s) == k:
		print('YES')
		b = [str(i + 1) for i in b]
		print(' '.join(b))
		break
if len(s) != k:
	print('NO')


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


l1 = list(map(int, input().split()))
n = l1[0]
k = l1[1]
l = list(map(int, input().split()))
ans = []
for i in l:
	if l.index(i) + 1 not in ans and k > 0:
		ans.append(l.index(i) + 1)
		k = k - 1
if k != 0:
	print('NO')
else:
	print('YES')
	for i in ans:
		print(i, end=' ')


(nstud, teams) = map(int, input().split())
ratings = list(map(int, input().split()))
if len(set(ratings)) < teams or len(ratings) != nstud:
	print('NO')
else:
	enc = []
	index = []
	for i in range(nstud):
		if ratings[i] not in enc:
			enc.append(ratings[i])
			index.append(str(i + 1))
		if len(index) == teams:
			break
	print('YES')
	print(' '.join(index))


line = input().split()
num_students = int(line[0])
team_size = int(line[1])
student_ratings = []
students = []
line = input().split()
for student in range(num_students):
	rating = int(line[student])
	if not rating in student_ratings:
		student_ratings.append(rating)
		students.append(student)
if len(students) >= team_size:
	print('YES')
	for i in range(team_size):
		print(students[i] + 1, end=' ')
	print()
else:
	print('NO')


(n, k) = map(int, input().split(' '))
mydict = dict()
for (index, myval) in enumerate(map(int, input().split(' ')), start=1):
	if not myval in mydict.keys():
		mydict[myval] = index
if k > len(mydict.keys()):
	result = 'NO'
else:
	mylist = list(mydict.values())[:k]
	result = f"YES\n{' '.join(map(str, mylist))}"
print(result)


(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, m) = map(int, input().split())
a = list(map(int, input().split()))
p = []
g = []
j = k = 0
for i in range(n):
	p.append([i + 1, a[i]])
a = sorted(list(set(a)))
p.sort(key=lambda x: x[1])
while k < len(a):
	if a[k] == p[j][1]:
		g.append(p[j][0])
		k += 1
		j += 1
	else:
		j += 1
g.sort()
if len(a) >= m:
	print('YES')
	print(' '.join(map(str, g[:m])))
else:
	print('NO')


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
d = set(c)
if len(d) < b:
	print('NO')
else:
	print('YES')
	e = []
	f = []
	m = int(0)
	x = int(0)
	while x < a and m < b:
		if c[x] not in e:
			e.append(c[x])
			f.append(x + 1)
			m = m + 1
		x = x + 1
	print(*f)


from collections import Counter
(n, k) = map(int, input().split())
arr = list(map(int, input().split()))
c = Counter(arr)
if len(c) >= k:
	print('YES')
	cnt = k
	for i in range(n):
		if cnt == 0:
			break
		if arr[i] in c:
			print(i + 1, end=' ')
			del c[arr[i]]
			cnt -= 1
else:
	print('NO')


def main():
	(n, k) = input().split(' ')
	n = int(n)
	k = int(k)
	dic = {}
	a = input().split(' ')
	for i in range(n):
		a[i] = int(a[i])
		if a[i] not in dic:
			dic[a[i]] = i + 1
	if len(dic.keys()) < k:
		print('NO')
	else:
		print('YES')
		team = list(dic.values())
		teamStr = str(team[0]) + ' '
		for j in range(1, k):
			teamStr = teamStr + str(team[j]) + ' '
		print(teamStr)
main()


(n, k) = input().split(' ')
k = int(k)
a_list = [a for a in input().split(' ')]
count = 0
team_list = []
index_team_list = []
for (i, a) in enumerate(a_list):
	if a not in team_list:
		team_list.append(a)
		index_team_list.append(i + 1)
		count += 1
	if count == k:
		print('YES')
		for index in index_team_list:
			print(index, end=' ')
		break
else:
	print('NO')


import sys
(n, k) = map(int, sys.stdin.readline().split())
an = list(map(int, sys.stdin.readline().split()))
d = {}
for i in range(n):
	if an[i] not in d:
		d[an[i]] = i + 1
if len(d) >= k:
	print('YES')
	count = 0
	for (_, v) in d.items():
		print(v, end=' ')
		count += 1
		if count == k:
			break
	print()
else:
	print('NO')


(n, k) = map(int, input().split())
(a, c, o) = (set(), 1, [])
for i in input().split():
	if i not in a:
		a.add(i)
		o += [str(c)]
	c += 1
if len(o) < k:
	print('NO')
else:
	print('YES')
	print(' '.join(o[:k]))


(n, k) = map(int, input().split())
array = list(map(int, input().split()))
(numb, rating) = ([], [])
for i in range(len(array)):
	if array[i] not in rating:
		rating.append(array[i])
		numb.append(i + 1)
if len(numb) >= k:
	print('YES')
	for i in numb[:k]:
		print(i, end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
ar = list(map(int, input().split()))
s = set(ar)
output = []
if len(s) < k or k > len(ar):
	print('NO', end='')
else:
	print('YES')
	d = {}
	for i in range(len(ar)):
		if ar[i] not in d:
			d[ar[i]] = i + 1
	for key in sorted(d):
		output.append(d[key])
	output.sort()
	for i in range(k):
		print(output[i], end=' ')


def solve(test):
	(n, k) = map(int, input().split())
	a = list(map(int, input().split()))
	ans = []
	old = []
	for i in range(n):
		if a[i] not in old:
			ans.append(i + 1)
		old.append(a[i])
	if len(ans) < k:
		print('NO')
	else:
		print('YES')
		print(*ans[:k])
t = 1
for _ in range(t):
	solve(_ + 1)


n = list(map(int, input().split()))
k = list(map(int, input().split()))
li = []
m = []
for i in range(n[0]):
	if k[i] not in li:
		li.append(k[i])
		m.append(i + 1)
if len(m) >= n[1]:
	print('YES')
	for j in range(n[1]):
		print(m[j], end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
s = input().split()
team = []
team_values = []
for (i, a) in enumerate(s):
	if a not in team_values:
		team += [i]
		team_values += [a]
if len(team) >= k:
	print('YES')
	for x in range(k):
		print(team[x] + 1, end='')
		if x != k - 1:
			print(' ', end='')
	print()
else:
	print('NO')


dic = {}
(n, k) = [int(c) for c in input().split()]
notas = [int(c) for c in input().split()]
indices = []
for (i, nota) in enumerate(notas):
	if nota in dic.keys():
		dic[nota] += 1
	else:
		indices.append(i + 1)
		dic[nota] = 1
if len(dic) >= k:
	print('YES')
	print(' '.join((str(x) for x in indices[:k])))
else:
	print('NO')


numbers1 = input().split(' ')
k = int(numbers1[1])
x = int(numbers1[0])
numbers = input().split(' ')
prev_numbers = []
indices = []
i = 0
while i < len(numbers) and len(prev_numbers) < k:
	q = int(numbers[i])
	if q not in prev_numbers:
		prev_numbers.append(q)
		indices.append(i + 1)
	i += 1
if len(prev_numbers) >= k:
	s = ''
	print('YES')
	for i in indices:
		s += str(i) + ' '
	print(s[:-1])
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()


def solve(n, k, a):
	if len(set(a)) < k:
		return 'NO'
	else:
		s = set()
		sv = set()
		for (i, v) in enumerate(a):
			if len(s) == k:
				break
			if v not in sv:
				s.add(i + 1)
				sv.add(v)
		r = 'YES\n'
		r += ' '.join(map(str, s))
		return r

def main():
	(n, k) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	print(solve(n, k, a))
main()


[n, k] = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
S = set()
ans = []
for i in range(0, n):
	if a[i] not in S:
		S.add(a[i])
		ans += [i + 1]
if len(ans) < k:
	print('NO')
else:
	print('YES')
	print(*ans[:k])


nm = input().split(' ')
n = int(nm[0])
m = int(nm[1])
l = list(map(int, input().split(' ')))
M = []
for i in range(len(l)):
	if l[i] not in M:
		M.append(l[i])
if len(M) >= m:
	print('YES')
	for i in range(m):
		if i == len(M) - 1:
			print(l.index(M[i]) + 1, end='')
		else:
			print(l.index(M[i]) + 1, end=' ')
else:
	print('NO')


(n, k) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
was = []
if len(set(l)) >= k:
	print('YES')
	for i in range(len(l)):
		if l[i] not in was:
			was.append(l[i])
			if len(was) == k:
				print(i + 1)
				break
			else:
				print(i + 1, end=' ')
else:
	print('NO')


(N, M) = map(int, input().split())
A = [int(j) for j in input().split()]
I = [1]
for i in range(1, N):
	if A[i] not in A[:i]:
		I.append(i + 1)
if len(I) < M:
	print('NO')
else:
	print('YES')
	print(*I[:M])


[n, k] = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b = []
c = []
for i in range(0, n):
	if a[i] not in b and len(b) < k:
		b.append(a[i])
		c.append(i + 1)
if len(b) < k:
	print('NO')
else:
	print('YES')
	for i in c:
		print(i, end=' ')


[n, k] = map(int, input().split())
a = list(map(int, input().split()))
b = {}
for (i, v) in enumerate(a):
	if not v in b:
		b[v] = i + 1
if len(b) >= k:
	print('YES')
	print(' '.join(list(map(str, b.values()))[:k]))
else:
	print('NO')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
team = []
ind = []
for i in range(len(a)):
	if not a[i] in team:
		team.append(a[i])
		ind.append(i + 1)
if len(ind) >= k:
	print('YES')
	for i in ind[:k]:
		print(i, end=' ')
else:
	print('NO')


(n, m) = map(int, input().split())
a = input().split()
b = []
c = []
for i in range(len(a)):
	if a[i] not in b:
		b.append(a[i])
		c.append(i + 1)
		m -= 1
	if not m:
		print('YES')
		print(*c)
		break
else:
	print('NO')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
s = set()
p = []
for i in range(n):
	if a[i] not in s:
		s.add(a[i])
		k -= 1
		p.append(i + 1)
		if k == 0:
			break
if k == 0:
	print('YES')
	print(*p)
else:
	print('NO')


(n, m) = map(int, input().split())
a = list(map(int, input().split()))
s = set()
count = 0
ans = []
for i in range(n):
	if not a[i] in s:
		count += 1
		ans.append(i + 1)
		s.add(a[i])
if count >= m:
	print('YES')
	print(*ans[:m])
else:
	print('NO')


(n, k) = map(int, input().split())
a = input().split()
for i in range(n):
	a[i] = int(a[i])
t = set(a)
d = 0
q = 0
if len(t) < k:
	print('NO')
else:
	print('YES')
	while q < k and d < len(a):
		if a[d] in t:
			print(d + 1, end=' ')
			t.remove(a[d])
			q += 1
		d += 1


(n, k) = input().split(' ')
nums = []
unique = {}
values = [int(i) for i in input().split()]
for i in range(0, len(values)):
	if len(unique) < int(k):
		if values[i] not in unique.values():
			unique[i + 1] = values[i]
if int(len(unique)) == int(k):
	print('YES')
	for key in unique.keys():
		print(key, end=' ')
else:
	print('NO')


(a, b) = map(int, input().split())
p = set()
q = set()
list1 = list(map(int, input().split()))
for i in range(a):
	if len(q) == b:
		continue
	siz = len(p)
	p.add(list1[i])
	if siz == len(p):
		continue
	q.add(i + 1)
if len(p) < b:
	print('NO')
else:
	print('YES')
	list2 = list(q)
	for i in range(len(q)):
		print(str(list2[i]) + ' ', end='')


num = input().split()
mark = input().split()
group = int(num[0]) // int(num[1])
result = []
end = []
for i in range(len(mark)):
	if int(mark[i]) not in result:
		result = result + [int(mark[i])]
		end = end + [str(i + 1)]
	if len(end) == int(num[1]):
		break
if int(num[1]) != len(end):
	print('NO')
else:
	print('YES')
	print(' '.join(end))


StSi = list(map(int, input().split()))
Students = list(map(int, input().split()))
mylist = list()
mylist2 = list()
ans = ''
for a in range(len(Students)):
	if Students[a] not in mylist:
		mylist.append(Students[a])
		mylist2.append(a)
if len(mylist) >= StSi[1]:
	print('YES')
	for a in range(StSi[1]):
		ans += str(mylist2[a] + 1) + ' '
	print(ans)
else:
	print('NO')


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
s = set(l)
l1 = []
l2 = []
if len(s) >= k:
	print('YES')
	for i in s:
		for j in range(len(l)):
			if i == l[j]:
				l1.append(j + 1)
				break
	l1.sort()
	for i in range(k):
		l2.append(l1[i])
	print(*l2)
else:
	print('NO')


(students, team_size) = list(map(int, input().split()))
rating = list(map(int, input().split()))
final_team = []
final_team.append(rating[0])
team_size -= 1
i = 1
while team_size > 0 and i < students:
	if rating[i] in final_team:
		i += 1
	else:
		final_team.append(rating[i])
		team_size -= 1
		i += 1
indexes = []
if team_size == 0:
	print('YES')
	for a in final_team:
		indexes.append(rating.index(a) + 1)
	print(*indexes, sep=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
ans = []
for i in range(n):
	flag = True
	for o in ans:
		if a[i] == o[0]:
			flag = False
	if flag:
		ans.append((a[i], i))
if len(ans) >= k:
	print('YES')
	for i in range(k):
		print(ans[i][1] + 1, end=' ')
else:
	print('NO')


(n, k) = map(int, input().split())
s = [int(x) for x in input().split()]
pos = []
for i in range(0, len(s)):
	pos.append(i)
if len(set(s)) < k:
	print('NO')
else:
	print('YES')
	kk = dict()
	L = []
	for i in range(0, len(s)):
		if kk.get(s[i]) == None:
			L.append(i + 1)
			kk[s[i]] = 1
	L = L[:k]
	print(*L)


import sys
from collections import Counter

def input():
	return sys.stdin.readline().strip()

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def list4d(a, b, c, d, e):
	return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]

def ceil(x, y=1):
	return int(-(-x // y))

def INT():
	return int(input())

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

def LIST(N=None):
	return list(MAP()) if N is None else [INT() for i in range(N)]

def Yes():
	print('Yes')

def No():
	print('No')

def YES():
	print('YES')

def NO():
	print('NO')
INF = 10 ** 18
MOD = 10 ** 9 + 7
(N, K) = MAP()
A = LIST()
S = set()
ans = []
for i in range(N):
	if A[i] not in S:
		S.add(A[i])
		ans.append(i + 1)
		if len(ans) == K:
			break
else:
	NO()
	exit()
YES()
print(*ans)


(l, k) = list(map(int, input().split()))
pop = list(map(int, input().split()))
lol = []
for item in pop:
	if item not in lol:
		lol.append(item)
	else:
		pass
kam = []
if len(lol) < k:
	print('NO')
else:
	print('YES')
	for itm in lol:
		if len(kam) == k:
			break
		else:
			kam.append(pop.index(itm) + 1)
	print(*kam)


(n, k) = map(int, input().split())
scores = input().split()
temp = set()
result = []
if len(set(scores)) < k:
	print('NO')
	exit()
else:
	for i in range(len(scores)):
		if scores[i] not in temp and len(result) < k:
			temp.add(scores[i])
			result.append(i + 1)
print('YES')
result = [str(x) for x in result]
print(' '.join(result))


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
if len(set(l)) >= k:
	print('YES')
	seti = set()
	ans = []
	for (j, i) in enumerate(l):
		if i not in seti:
			seti.add(i)
			ans.append(j + 1)
		if len(seti) == k:
			print(*ans)
			break
else:
	print('NO')


a = [int(i) for i in input().split()]
n = a[0]
k = a[1]
arr = [int(i) for i in input().split()]
arr1 = []
arr2 = []
for i in range(n):
	if arr[i] not in arr1:
		arr1.append(arr[i])
		arr2.append(i)
if len(arr2) >= k:
	print('YES')
	for i in range(k):
		print(arr2[i] + 1, end=' ')
	print()
else:
	print('NO')


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
t = set(l)
c = 0
if len(t) < k:
	print('NO')
else:
	print('YES')
	c += 1
	print('1', end=' ')
	l1 = [l[0]]
	for i in range(1, n):
		if c == k:
			break
		if l[i] not in l1:
			l1.append(l[i])
			print(i + 1, end=' ')
			c += 1


(n, k) = map(int, input().split())
grades = list(map(int, input().split()))
grades_set = set()
grades_list = list()
for (i, g) in enumerate(grades):
	if g not in grades_set:
		grades_set.add(g)
		grades_list.append((i, g))
if k > len(grades_set):
	print('NO')
else:
	print('YES')
	res = map(lambda x: x[0] + 1, grades_list[:k])
	print(' '.join(map(str, res)))