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.*;

public class B {
	
	public static void main(String[] args) {
		
		Scanner qwe = new Scanner(System.in);
		
		int n = qwe.nextInt();
		int k = qwe.nextInt();
		int q = qwe.nextInt();
		
		
		ArrayDeque<Integer> best = new ArrayDeque<Integer>();
		
		int[] t = new int[n];
		for (int i = 0; i < t.length; i++) {
			t[i] = qwe.nextInt();
		}
		
		while(q -->0){
			int type = qwe.nextInt();
			int id = qwe.nextInt()-1;
			
			if(type == 1){
				
				if(best.size() < k) best.add(id);
				else{
					int cur = id;
					for (int i = 0; i < k; i++) {
						int old = best.poll();
						
						if(t[old] < t[cur]){
							cur = cur^old^(old=cur);
						}
						
						best.add(old);
						
					}
					
				}
			}
			else{
				boolean good = false;
				for (int i = 0; i < best.size(); i++) {
					int at = best.poll();
					if(at == id) good = true;
					best.add(at);
				}
				
				if(good) System.out.println("YES");
				else System.out.println("NO");
				
			}
			
			
		}
		
		
		qwe.close();
	}

}
