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 heapq
n,k,q=[int(i) for i in input().split()]
k=min(k,n)
Relations=[None]
ind=[0]*(n+1)
heap=[]
l=0
Rmax=0
for i in input().split() :
    Relations.append(-int(i))
for i in range(q) :
    Q,ID=[int(j) for j in input().split()]
    if Q==1 :
        #print(heap,Rmax,Relations[ID])
        ind[ID]=1
        if l<k :
            heap.append(Relations[ID])
            heap.sort()
            l+=1
            Rmax=heap[l-1]
        else :
            if Relations[ID]<Rmax :
                heap[k-1]=Relations[ID]
                heap.sort()
                Rmax=heap[l-1]
        #print(heap,Rmax)
    if Q==2 :
        if not ind[ID] :
            print("NO")
            continue
        Ri=Relations[ID]
        #print(heap,Ri)
        N=min(k,l)
        if Rmax<Ri :
            print("NO")
        else :
            print("YES")