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

public class B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int k = in.nextInt();
		int q = in.nextInt();
		int[][] t = new int[n][2];
		for (int i = 0; i < n; i++) {
			t[i][0] = i+1;
			t[i][1] = in.nextInt();
		}
		PriorityQueue<Integer[]> queue = new PriorityQueue<Integer[]>(new Comparator<Integer[]>() {
			@Override
			public int compare(Integer[] o1, Integer[] o2) {
				if (o1[1] < o2[1])
					return -1;
				else
					return 1;
			}
			
		});
		for (int i = 0; i < q; i++) {
			int querry = in.nextInt();
			int id = in.nextInt();
			if (querry == 1) {
				if (queue.size() < k) {
					Integer[] temp = new Integer[2];
					temp[0] = id;
					temp[1] = t[id-1][1];
					queue.add(temp);
				} else {
					if (queue.peek()[1] < t[id-1][1]) {
						Integer[] temp = new Integer[2];
						temp[0] = id;
						temp[1] = t[id-1][1];
						queue.add(temp);
						queue.poll();
					}
				}
			} else {
				boolean found = false;
				for (Integer[] temp: queue)
					if (temp[0] == id)
						found = true;
				System.out.println(found?"YES":"NO");
			}
		}
	}
}
