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 math
from heapq import heappush
from heapq import nlargest
from _heapq import heappop

IN = lambda : map(int, raw_input().split(' '))

n, k, q = IN()
t = IN()
v = [0]*n
Q = []

cnt = 0

for i in range(0,q):
    op, idx = map(int, raw_input().split(' '))
    idx = idx - 1
    if op is 1:
        if v[idx] is 0:
            v[idx] = 1
            heappush(Q, t[idx])
            cnt = cnt + 1
            if cnt > k:
                cnt -= 1
                heappop(Q)
    else:
        if v[idx] and t[idx] >= Q[0]:
            print 'YES'
        else:
            print 'NO'
    