1 1 1
1000000000
2 1
 20 2 15
12698951 55128070 116962690 156763505 188535242 194018601 269939893 428710623 442819431 483000923 516768937 552903993 633087286 656092270 671535141 714291344 717660646 846508634 879748146 937368929
2 7
1 2
2 4
1 19
1 12
1 5
2 18
2 11
1 16
2 1
2 3
2 19
1 17
2 9
2 6
 6 3 10
62417580 78150524 410053501 582708235 630200761 760672946
2 2
1 5
1 2
1 4
2 4
2 1
2 1
1 6
2 5
2 6

NO
 NO
NO
NO
NO
NO
NO
YES
NO
NO
 NO
YES
NO
NO
YES
YES

from queue import PriorityQueue
n, k, q = [int(i) for i in input().split()]
display = [0]*(n+1)
order = PriorityQueue(k+1)
friend = [int(i) for i in input().split()]
minfri = 0
ans = []
for i in range(q):
	kind, idd = [int(j) for j in input().split()]
	if kind == 1:
		if friend[idd-1] <= minfri:
			continue
		else:
			order.put((friend[idd-1], idd))
			display[idd] = 1
			if order.full():
				tem = order.get()
				de, minfri = tem[1], tem[0]
				display[de] = 0
	if kind == 2:
		if display[idd] == 1:
			ans.append('YES')
		else:
			ans.append('NO')
print('\n'.join(ans))