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 sys
class node:
    def __init__(self,id):
        self._id=id
        self._children=[]
        self._parent=[]
queue=[]
tail=0
n,k,q= map(int,sys.stdin.readline().split())
a=n*[0]
s=input()
a=s.split()
for i in range(n):
    a[i]=int(a[i])
    
for i in range(q):
    type,idd=map(int,sys.stdin.readline().split())
    idd-=1
    if type==1:
        if len(queue)==0:
            queue.append(node(idd))
        else:           
            l=len(queue)
            queue.append(node(idd))
            for j in range(len(queue)-1):
                    if queue[j]._parent==[]:
                        h=queue[j]
                        head=j
            while (a[h._id]>a[idd])and(h._children!=[]):
                h=h._children[0]
                for j in range(len(queue)):
                    if queue[j]==h:
                        head=j
            if a[h._id]<a[idd]:
                if h._parent==[]:
                    queue[head]._parent=[queue[l]]
                    queue[l]._children=[queue[head]]
                else:
                    queue[head]._parent[0]._children=[queue[l]]
                    queue[l]._parent=[queue[head]._parent[0]]
                    queue[head]._parent=[queue[l]]
                    queue[l]._children=[queue[head]]
                    
            else:
                for j in range(l):
                    if queue[j]._children==[]:
                        tail=j
                queue[tail]._children.append(queue[l])
                queue[l]._parent.append(queue[tail])
            if len(queue)>k:
                for j in range(len(queue)):
                    if queue[j]._children==[]:
                        tail=j
                queue[tail]._parent[0]._children=[]
                queue.remove(queue[tail])

    if type==2:
        boolean=0
        for j in range(len(queue)):
            if queue[j]._id==idd:
                boolean=1
                print('YES')
        if boolean==0:
            print('NO')