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


def siftup(ind):
    global tree
    while (ind != 1) and (frendly[tree[ind]] < frendly[tree[ind // 2]]):
        tree[ind], tree[ind // 2] = tree[ind // 2], tree[ind]
        ind //= 2
    

def siftdown(ind):
    global tree
    while (ind * 2 + 1 <= len(tree) - 1) and (frendly[tree[ind]] > frendly[tree[ind * 2]] or frendly[tree[ind]] > frendly[tree[ind * 2 + 1]]):
        if frendly[tree[ind * 2]] > frendly[tree[ind * 2 + 1]]:
            tree[ind], tree[ind * 2 + 1] = tree[ind * 2 + 1], tree[ind]
            ind = ind * 2 + 1
        else:
            tree[ind], tree[ind * 2] = tree[ind * 2], tree[ind]
            ind *= 2
    if (ind * 2 <= len(tree) - 1) and (frendly[tree[ind]] > frendly[tree[ind * 2]]):
        tree[ind], tree[ind * 2] = tree[ind * 2], tree[ind]
        ind *= 2
        
    
n, k, q = map(int, sys.stdin.readline().split())
frendly = [0] + list(map(int, sys.stdin.readline().split()))
bearsout = set([i for i in range(1, n + 1)])
tree = [0]
for i in range(q):
    lab, b = map(int, sys.stdin.readline().split())
    if lab == 1:
        if len(tree) > k:
            if frendly[b] > frendly[tree[1]]:
                bearsout.discard(b)
                bearsout.add(tree[1])
                tree[1] = b
                siftdown(1)
        else:
            tree.append(b)
            bearsout.discard(b)
            siftup(len(tree) - 1)
    else:
        if b in bearsout:
            sys.stdout.write('NO' + '\n')
        else:
            sys.stdout.write('YES' + '\n')
            #