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

import bisect
line = input().split()
n = int(line[0])
k = int(line[1])
q = int(line[2])

f = input().split()
friendship = {}
display = []
size = 0
for i in range(1, n+1):
    friendship[i] = int(f[i-1])

for i in range(q):
    line = input().split()
    query = int(line[0])
    id = int(line[1])
    if query == 1:
        # if len(display) == 0:
        #     display.append((friendship[id], id))
        #     size += 1
        # else:
        #     # ''' binary search '''
        #     # l = 0
        #     # r = size-1
        #     # pos = 0
        #     # while l <= r:
        #     #     pos = (l + r) // 2
        #     #     if friendship[id] > friendship[display[pos]]:
        #     #         l = pos + 1
        #     #     else:
        #     #         r = pos - 1
        #     # display = display[:l] + [id] + display[l:]
        #     # size += 1
        #     # if size > k:
        #     #     display = display[1:]
        #     #     size = k
        #
        #
        #
        bisect.insort(display, (friendship[id], id))
        size += 1
        if size > k:
            display = display[1:]
            size = k

    if query == 2:
        if (friendship[id], id) in display:
            print("YES")
        else:
            print("NO")

 				      				 	  	   			 	  	