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

from collections import deque
class heap:
    def __init__(self,k):
        self.heap=deque()
        self.len=0
        self.k=k
        self.reversedheap=deque()
    def add(self,x):
        self.heap.appendleft(x)
        self.reversedheap.append(x)
        self.len+=1
        self.standize()
        if self.len>self.k:
            self.pop()
            self.len=self.k
        self.standize()

    def pop(self):
        self.heap.remove(self.reversedheap.popleft())
    def standize(self):        
        t=0
        k=self.len
        while 2*t+1<=k-1:
            if self.reversedheap[t]>self.reversedheap[2*t+1]:
                self.reversedheap[2*t+1],self.reversedheap[t]=self.reversedheap[t],self.reversedheap[2*t+1]
                t=2*t+1
            elif 2*t+2<=k-1 and self.reversedheap[t]>self.reversedheap[2*t+2]:
                self.reversedheap[2*t+2],self.reversedheap[t]=self.reversedheap[t],self.reversedheap[2*t+2]
                t=2*t+2
            else:
                break
        t=0
        while 2*t+1<=k-1:
            if self.heap[t]<self.heap[2*t+1]:
                self.heap[2*t+1],self.heap[t]=self.heap[t],self.heap[2*t+1]
                t=2*t+1
            elif 2*t+2<=k-1 and self.heap[t]<self.heap[2*t+2]:
                self.heap[2*t+2],self.heap[t]=self.heap[t],self.heap[2*t+2]
                t=2*t+2
            else:
                break
    def show(self,x):
        if x in set(self.heap):
            print('YES')
        else:
            print('NO')
        
n,k,q=map(int,input().split())
t=list(map(int,input().split()))
online=heap(k)
for i in range(q):
    typei,idi=map(int,input().split())
    if typei==1:
        online.add(t[idi-1])
    else:
        online.show(t[idi-1])