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 java.util.*;

public class  Main{
	public static int nFrnd, max, nQuer;
	public static PriorityQueue<Long> online, temp;
	public static long[] friends;
	public static void main(String[] args){
		online = new PriorityQueue<Long>(Collections.reverseOrder());
		temp = new PriorityQueue<Long>(Collections.reverseOrder());
		Scanner in = new Scanner(System.in);
		nFrnd = in.nextInt(); max = in.nextInt(); nQuer = in.nextInt();
		friends = new long[nFrnd];
		//setup friend number with friend value
		for(int i = 0; i < nFrnd; i++){
			friends[i] = in.nextInt();
		}

		//process input
		process(in);
	}

	public static void process(Scanner in){
		boolean ol = false;
		for(int q = 0; q < nQuer; q++){
			ol = false;
			if(in.nextInt() == 1){ //someone is about to go online
				online.add(friends[(in.nextInt())-1]); //add the value of the friend who went online
			}else{ //asking if someone is online
				long targetVal = friends[(in.nextInt())-1]; //get friend value of this friend
				long olVal = 0;
				
				for(int i = 0; i < max; i++){ //keep popping from priority queue until found or reached max
					if(online.size()==0)
						break;
					olVal = online.poll();
					temp.add(olVal);
					if(olVal == targetVal){
						ol = true;
						break;
					}
				}
				
				if(ol)
					System.out.println("YES");
				else
					System.out.println("NO");

				//popped everything popped out back onto online pQueue
				int size = temp.size();
				for(int v = 0; v < size; v++){
					long val = temp.poll();
					online.add(val);
				}
			}
		}
	}
}