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.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Scanner;


public class BearAndDisplayedFriends {

	public static boolean visible;

	public static HashMap<Integer, Integer> M3zaIDs = new HashMap<>();
	public static ArrayList<Integer> onlines = new ArrayList<>();

	private static int friendIndex;

	private static Scanner in;

	public static void main(String[] args) {

		int n, k, q;
		int currentQ, currentId;

		in = new Scanner(System.in);
		n = in.nextInt();

		k = in.nextInt();
		q = in.nextInt();
		for (int i = 0; i < n; i++) {
			M3zaIDs.put(i + 1, in.nextInt());

		}

		for (int j = 0; j < q; j++) {
			currentQ = in.nextInt();
			currentId = in.nextInt();
		
			if (currentQ == 1)
				onlines.add(M3zaIDs.get(currentId));
			if (currentQ == 2) {
				if (onlines.size() <= k) {
					if (isHere(currentId))
						System.out.println("YES");
					else
						System.out.println("NO");

				} else {
					if (isHere(currentId)) {
						visible=false;
						Collections.sort(onlines);
						friendIndex=onlines.indexOf(M3zaIDs.get(currentId));
						if(friendIndex>=(onlines.size()-k))
							visible = true;
						if (visible)
							System.out.println("YES");
						else
							System.out.println("NO");
					}
				}

			}
		}

	}

	public static boolean isHere(int currentId) {

		for (Integer integer : onlines) {
			if (integer == M3zaIDs.get(currentId)) {
				return true;
			}
		}
		return false;
	}

}
