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

'''
Created on 2016-4-27

@author: chronocorax
'''
def line(): return [int(c) for c in input().split()]

n, k, q = line()
t = line()
H = []

from heapq import *

N = 0

H = []

for _ in range(q):
    taipe, i = line()
    if taipe == 1:
        heappush(H, (t[i - 1], i))
        if N < k:
            N += 1
        else:
            heappop(H)
    elif taipe == 2:
        if (t[i - 1], i) in H:
            print('YES')
        else:
            print('NO')