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 = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
dis = []
for _ in range(q):
    typ,ID = [int(j) for j in input().split()]
    if typ == 1:
        if len(dis) == 0:
            dis.append(ID)
        else:
            for i in range(len(dis)-1,-1,-1):
                if t[dis[i]-1] > t[ID-1]:
                    dis.insert(i+1,ID)
                    break
            else:
                dis = [ID] + dis
            if len(dis) > k:
                dis.pop()
        #print(dis)
    elif typ == 2:
        if ID in dis:
            print('YES')
        else:
            print('NO')
            
            
