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.PriorityQueue;
import java.util.Scanner;

public class BearAndDisplayedFriends {
	public static void main(String[] args) {
		
		// maintain k max within a stream of ints
		// max heap 
			// ^ review impl 
		// data structure? using priorityqueue for now
			// ^ review usage (BIG -> SMALL) (SMALL -> BIG)

		Scanner in = new Scanner(System.in);
		String start = in.nextLine();
		String[] startArr = start.split(" ");
		int n = Integer.parseInt(startArr[0]); 
		int k = Integer.parseInt(startArr[1]); 
		int q = Integer.parseInt(startArr[2]);
		
		PriorityQueue<Integer> topK = new PriorityQueue<Integer>(); 
		// can technically throw away the old ones to save space since no friends will log out
		
//		topK.add(3);
//		topK.add(2);
//		topK.add(4);
//		System.out.println(topK.poll());
//		System.out.println(topK.poll());
//		System.out.println(topK.poll());
		int[] t = new int[n];
		for (int i = 0 ; i < n; i++){
			t[i] = in.nextInt();
//			System.out.println(t[i]);
		}
		
		int[] type = new int[q];
		int[] id = new int[q];
		for (int i = 0; i < q; i++){
			type[i] = in.nextInt();
			id[i] = in.nextInt();
		}
		
		for (int i = 0; i < q; i++){
//			int type = in.nextInt();
//			int id = in.nextInt();
//			System.out.println(type + " " + id);
			
			if(type[i] == 1){
				if (topK.size() < k)
					topK.add(id[i]);
				else{ // == k
					if (topK.peek() < id[i]){
						topK.poll(); // pop off smallest
						topK.add(id[i]);
					}
				}
			}
			else{
				if (topK.contains(id[i]))
					System.out.println("YES");
				else
					System.out.println("NO");
			}
//			System.out.println(".");
		}
	}
}
