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

public class VKCupQualA {

	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		PrintWriter cout = new PrintWriter(System.out);
		int N = cin.nextInt(), k = cin.nextInt(), q = cin.nextInt();
		int[] a = new int[N];
		for (int i = 0; i < N; ++i)
			a[i] = cin.nextInt();
		int type, id;
		boolean fl;
		int[] b = new int[k];
		Arrays.fill(b, -1);
		for (int i = 0; i < q; ++i) {
			type = cin.nextInt();
			id = cin.nextInt() - 1;
			if (type == 2) {
				fl = false;
				for (int j = 0; j < b.length; ++j) {
					if (b[j] == id) {
						fl = true;
						break;
					}
				}
				cout.println(fl ? "YES" : "NO");
			} else {
				int min = 0;
				if (b[min] != -1)
					for (int j = 0; j < b.length; ++j)
						if (b[j] == -1) {
							min = j;
							break;
						} else if (a[b[j]] < a[b[min]])
							min = j;
				b[min] = id;
			}
		}
		cout.flush();
	}

}