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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class Main {
	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 k = Integer.parseInt(st.nextToken());
		int q = Integer.parseInt(st.nextToken());
		
		TreeMap<Integer, Integer> list = new TreeMap<Integer, Integer>();
		st = new StringTokenizer(br.readLine());
		for (int i=1;i<=n;i++) {
			list.put(i, Integer.parseInt(st.nextToken()));
		}
		
		TreeSet<Integer> online = new TreeSet<Integer>();
		
		while (q-- > 0) {
			st = new StringTokenizer(br.readLine());
			int f = Integer.parseInt(st.nextToken());
			int id = Integer.parseInt(st.nextToken());
			
			int val = list.get(id);
			
			if (f == 1) {
				online.add(val);
				while (online.size() > k) {
					online.pollFirst();
				}
			} else {
				if (online.contains(val)) {
					System.out.println("YES");
				} else {
					System.out.println("NO");
				}
			}
		}
		
		br.close();
    }
}