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 -*-
"""
Created on Mon Mar 28 19:47:23 2016

@author: Emad Yehya
"""

l = raw_input().split(' ')
n = int(l[0])
k = int(l[1])
qs = int(l[2])

A = [0]*(k+1)
l = raw_input().split(' ')
F = [0]
for x in l:
    F.append(int(x))


def check_true(n):
    for i in A:
        if(n == i):
            return True
            
    return False
    
    
def add_friend(n):
    A[k] = n
    add_friend_rec(k)
    A[k] = 0

def add_friend_rec(lvl):
    if(lvl == 0):
        return
    if(F[A[lvl]] > F[A[lvl-1]]):
        tmp = A[lvl]
        A[lvl] = A[lvl-1]
        A[lvl-1] = tmp
        add_friend_rec(lvl-1)
    

for q in range(0, qs):
    l= raw_input().split(' ')
    if(l[0] == '1'):
        add_friend(int(l[1]))
    else:
        if(check_true(int(l[1]))):
            print "YES"
        else:
            print "NO"
        
        
    