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.HashMap;
import java.util.HashSet;


public class Bear1 {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n, k, q;
		String inp[] = new String[3];
		inp = br.readLine().split(" ");
		n = Integer.parseInt(inp[0]);
		k = Integer.parseInt(inp[1]);
		q = Integer.parseInt(inp[2]);
		String inp1[] = new String[n];
		inp1 = br.readLine().split(" ");
		HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
		for (int i = 0; i < inp1.length; i++) {
			map.put(i+1, Integer.parseInt(inp1[i]));
		}
		HashSet<Integer> set = new HashSet<Integer>();
		while(q-->0){
			inp = br.readLine().split(" ");
			int temp= Integer.parseInt(inp[1]);
			if(inp[0].equals("1")){
				if(set.size()==k){
					int minval =Integer.MAX_VALUE;
					int min=-1;
					for (Integer x: set) {
						if(map.get(x)<minval){
							minval=map.get(x);
							min=x;
						}
					}
					if(minval<map.get(temp)){
						set.remove(min);
						set.add(temp);
					}
					
				}
				else{
					set.add(temp);
				}
			}
			else{
				
				if(set.contains(temp)){
					System.out.println("YES");
				}
				else{
					System.out.println("NO");
				}
			}
		}
	}

}
