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

public class CF658B {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int j = 0, k = Integer.parseInt(st.nextToken());
		int q = Integer.parseInt(st.nextToken());
		int[] tt = new int[n];
		st = new StringTokenizer(br.readLine());
		for (int i = 0; i < n; i++)
			tt[i] = Integer.parseInt(st.nextToken());
		int[] aa = new int[k];
		PrintWriter pw = new PrintWriter(System.out);
		while (q-- > 0) {
			st = new StringTokenizer(br.readLine());
			int type = Integer.parseInt(st.nextToken());
			int id = Integer.parseInt(st.nextToken()) - 1;
			if (type == 1) {
				if (j < k)
					aa[j++] = id;
				else {
					int tmin = Integer.MAX_VALUE, imin = -1;
					for (int i = 0; i < j; i++)
						if (tmin > tt[aa[i]]) {
							tmin = tt[aa[i]];
							imin = i;
						}
					if (tt[id] > tmin)
						aa[imin] = id;
				}
			} else {
				boolean yes = false;
				for (int i = 0; i < j; i++)
					if (aa[i] == id) {
						yes = true;
						break;
					}
				pw.println(yes ? "YES" : "NO");
			}
		}
		pw.close();
	}
}
