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
from math import *
n, k ,q = map(int, input().split())
A = []
lens = 0
B = list(map(int, input().split()))
for i in range(q):
    per1,per2 = map(int, input().split())
    if per1 == 1:
        if lens < k:
            A.append([per2, B[per2-1]])
            lens += 1
        else:
            c = float('infinity')
            r = 0
            for i in range(k):
                if A[i][1] < c:
                    c = A[i][1]
                    r = i
            if B[per2 -1] > A[r][1]:
                
                A[r] = [per2, B[per2-1]]
    else:
        si = True
        for i in range(lens):
            if A[i][0] == per2:
                si = False
                break
        if si:
            print('NO')
        else:
            print('YES')
                