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,k,q = map(int,input().split())
t = list(map(int,input().split()))
d = {}
for i in range(n):
    d[i+1] = t[i]

sp = []

for i in range(q):
    a,b = map(int,input().split())
    if a == 1:
        if len(sp) == 0:
            sp.append(b)
        else:
            j = 0
            x = d[b]
            bb = True
            while d[sp[j]] > x:
                j += 1
                if j == len(sp):
                    if len(sp) < k:
                        sp.append(b)
                    bb = False
                    break
            if bb:
                s1 = sp[:j]
                s2 = sp[j:]
                sp = s1 + [b] + s2
                if len(sp) > k:
                    sp.remove(sp[-1])
    else:
        if b in sp:
            print('YES')
        else:
            print('NO')