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

def second():
    inp = input().split(' ')
    n = int(inp[0])
    q = int(inp[1])
    k = int(inp[2])
    p = []
    t = []
    t.append(0)
    friendlist = []
    it = input().split(' ')
    for i in it:
        t.append(int(i))
    for i in range(k):
        cur = []
        cur_inp = input().split(' ')
        cur.append(int(cur_inp[0]))
        cur.append(int(cur_inp[1]))
        p.append(cur)
    for i in range(k):
        if(p[i][0] == 1):
            lo = 0
            hi=None
            if lo < 0:
                raise ValueError('lo must be non-negative')
            if hi is None:
                hi = len(friendlist)
            while lo < hi:
                mid = (lo+hi)//2
                if friendlist[mid][1] < t[p[i][1]]: lo = mid+1
                else: hi = mid
            friendlist.insert(lo, [p[i][1], t[p[i][1]]])
        if(p[i][0] == 2):
            if([p[i][1],t[p[i][1]]] in friendlist):
                if((friendlist.index([p[i][1],t[p[i][1]]]) + 1 > len(friendlist) - q)):
                    print("Yes")
                else:
                    print("No")
            else:
                print("No")

second()