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 B {
	public static void main(String...donthackmeplease) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		int q = Integer.parseInt(st.nextToken());
		int[] t = new int[n];
		st = new StringTokenizer(br.readLine());
		for(int i = 0; i < n; i++){
			t[i] = Integer.parseInt(st.nextToken());
		}
		TreeMap<Integer, Integer> map = new TreeMap<>();
		boolean[] in = new boolean[n];
		for(int i = 0; i < q; i++){
			st = new StringTokenizer(br.readLine());
			int ty = Integer.parseInt(st.nextToken());
			int id = Integer.parseInt(st.nextToken())-1;
			if(ty == 1){
				map.put(t[id],id); in[id] = true;
				if(map.size() > k){
					int f = map.firstKey();
					int l = map.remove(f);
					in[l] = false;
				}
			}
			else{
				System.out.println(in[id]? "YES":"NO");
			}
		}
	}
}