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

__author__ = 'Utena'
from collections import deque
n,k,q=map(int,input().split())
screen=[]
ans=[]
relation=[0]+list(map(int,input().split()))
total=0
for i0 in range(q):
    type,id=map(int,input().split())
    if type==1:
        screen.append(id)
        total+=1
        for i in range(1,total):
            if relation[screen[-i]]>relation[screen[-i-1]]:
                a=screen[-i-1]
                screen[-i-1]=screen[-i]
                screen[-i]=a
        if total>k:
            screen.pop()
            total-=1
    if type==2:
        if id in screen:
            ans.append('YES')
        else:ans.append("NO")
print('\n'.join(ans))