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 as bs
n, k, q = [int(x) for x in raw_input().split()]
t = [-int(x) for x in raw_input().split()]
i = 0
a = []
while i < q:
    b = [int(x) for x in raw_input().split()]
    #print "1, 2 = ", b[0], b[1]
    #print a
    #print t[b[1] - 1]
    if b[0] == 1:
        bs.insort_left(a, t[b[1] - 1])
        if len(a) > k:
            del a[k]
        #print a
    else:
        #print (t[b[1] - 1] in a), min(k - 1, len(a))
        if  (t[b[1] - 1] in a) and t[b[1] - 1] <= a[min(k - 1, len(a) - 1)]:
            print "YES"
        else:
            print "NO"
    i = i + 1