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

INF = 1000000000000000

def find_min(v):
    minv, mini = INF, INF
    for i, x in enumerate(v):
        if x < minv:
            minv, mini = x, i
    return mini, minv


n, k, q = map(int, raw_input().split())
ts = map(int, raw_input().split())
v = []
for _ in xrange(q):
    x, y = map(int, raw_input().split())
    y -= 1
    e = ts[y]
    if x == 2:
        print ('YES' if e in v else 'NO')
    else:
        if len(v) < k:
            v.append(e)
        else:
            i, d = find_min(v)
            if e > d:
                v[i] = e
