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 B {
	Scanner sc = new Scanner(System.in);

	void run() {
		int n = sc.nextInt();
		int k = sc.nextInt();
		int q = sc.nextInt();
		PriorityQueue<Pair> que = new PriorityQueue<>();
		Pair[] p = new Pair[n];
		for (int i = 0; i < n; i++) p[i] = new Pair(sc.nextInt(), i);
		boolean[] on = new boolean[n];
		StringBuilder sb = new StringBuilder();
		while (q-- > 0) {
			int type = sc.nextInt();
			int id = sc.nextInt() - 1;
			Pair add = p[id];
			if (type == 1) {
				if (que.size() == k) {
					Pair top = que.poll();
					if (top.t < add.t) {
						que.add(add);
						on[top.b] = false;
						on[add.b] = true;
					} else {
						que.add(top);
						on[add.b] = false;
						on[top.b] = true;
					}
				} else {
					que.add(add);
					on[id] = true;
				}
			} else {
				sb.append(on[id] ? "YES" : "NO");
				sb.append("\n");
			}
		}
		System.out.print(sb);
	}

	class Pair implements Comparable<Pair> {

		int t;
		int b;

		public Pair(int t, int b) {
			super();
			this.t = t;
			this.b = b;
		}

		@Override
		public int compareTo(Pair arg0) {
			return this.t - arg0.t;
		}
	}

	public static void main(String[] args) {
		new B().run();
	}
}