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 io
import os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline


def binsearch(nums, target):
    left = 0
    right = len(nums) - 1
    while left <= right:
        mid = (left + right) // 2
        if nums[mid] == target:
            return mid
        elif nums[mid] > target:
            right = mid - 1
        elif nums[mid] < target:
            left = mid + 1

    return left

n, k, q = map(int, input().split())

rels = [int(z) for z in input().split()]

online = []

for query in range(q):

    t, f = map(int, input().split())

    if t == 1:
        pl = binsearch(online, rels[f - 1])

        online.insert(pl, rels[f - 1])

    if t == 2:
        if binsearch(online, rels[f - 1]) >= (len(online) - k) and rels[f - 1] in online:
            print("YES")
        else:
            print("NO")

        #print(binsearch(online, rels[f - 1]), online)





