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

public class Main{
	static int minToWindowOnline = 0;
	static int t[];
	static int k;
	static SortedMap window;
	
	public static void main(String[] args){
		int n, q;
		window = new TreeMap<Integer, Integer>();
		Scanner in = new Scanner(System.in);
		n = in.nextInt();
		k = in.nextInt();
		q = in.nextInt();
		t = new int[n];
		for(int i = 0; i < n; i++){
			t[i] = in.nextInt();
		}
		for(int i = 0; i < q; i++){
			switch(in.nextInt()){
				case 1: addFriend(in.nextInt()); break;
				case 2: searchFriend(in.nextInt()); break;
			}
		}
	}
	
	private static void addFriend(int id){
		if (window.size() == k){
			if (((Integer) window.firstKey()) < t[id-1]){
				//System.out.println("del " + window.firstKey());
				window.remove(window.firstKey());
				window.put(t[id-1], id);
			}
		}else window.put(t[id-1], id);
	}
	
	private static void searchFriend(int id){
		System.out.println(window.containsKey(t[id-1]) ? "YES" : "NO");
	}
}