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

n,q,k = map(int,raw_input().split())
n = map(int,raw_input().split())
t = []
def cmp(a,b):
    if a < b:
        return 1
    elif a == b:
        return 0
    else:
        return -1

for i in range(k):
    a,b = map(int,raw_input().split())
    if a == 1:
        t.append(n[b-1])
        t.sort(cmp)
        if(len(t) > q):
            t.pop()
    else:
        if len(t) <= q:
            if n[b-1] in t:
                print "YES"
            else:
                print "NO"
        elif n[b-1] in t[0:q]:
            print "YES"
        else:
            print "NO"