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

# -*- coding:utf-8 -*-

import bisect

class FriendNetwork(object):
    def __init__(self, n, k, points):
        self.friends = [False] * n
        self.k = k
        self.points = points
        self.len = 0
        self.pointFriendDict = {}
        for i in range(n):
            self.pointFriendDict[points[i]] = i
        self.L = []
    def query(self, type, id):
        if type == 1:
            bisect.insort_left(self.L, self.points[id])
            self.friends[id] = True
            self.len += 1
            if self.len > self.k:
                pop_point = self.L[0]
                self.L.pop(0)
                self.len -= 1
                pop_id = self.pointFriendDict[pop_point]
                self.friends[pop_id] = False
        else:
            print 'YES' if self.friends[id] == True else 'NO'
            
if __name__ == '__main__':
    n, k, q = map(int, raw_input().split())
    points = map(int, raw_input().split())
    fn = FriendNetwork(n, k, points)
    for i in range(q):
        type, id = map(int, raw_input().split())
        id -= 1
        fn.query(type, id)
            