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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.TreeSet;

public class VKR1 {

	public static void main(String args[]) throws IOException {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));

		String s[] = br.readLine().split(" ");

		int n = Integer.parseInt(s[0]);
		int k = Integer.parseInt(s[1]);
		int q = Integer.parseInt(s[2]);

		s = br.readLine().split(" ");
		int val[] = new int[n];

		for (int i = 0; i < n; i++)
			val[i] = Integer.parseInt(s[i]);

		int t[] = new int[q];
		int id[] = new int[q];

		for (int i = 0; i < q; i++) {
			s = br.readLine().split(" ");
			t[i] = Integer.parseInt(s[0]);
			id[i] = Integer.parseInt(s[1]);
		}

		TreeSet<Integer> ts = new TreeSet<Integer>();

		for (int i = 0; i < q; i++) {

			if (t[i] == 1) {

				if (ts.size() < k) {
					ts.add(val[id[i] - 1]);
				} else {
					ts.remove(ts.first());
					ts.add(val[id[i] - 1]);
				}
			} else {
				if (ts.contains(val[id[i] - 1]))
					System.out.println("YES");
				else
					System.out.println("NO");
			}
		}
	}
}