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


public class BearandDisplayedfriends {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner input = new Scanner(System.in);
		int n = input.nextInt();
		int k = input.nextInt();
		int q = input.nextInt();
		int[] arr = new int[n];
		for(int i=0; i<n;i++){
			arr[i] = input.nextInt();
		}
		HashSet<Integer> set =new HashSet<Integer>(k);
		for(int i=0; i<q;i++){
			int a = input.nextInt();
			if(a==1){
				int z = input.nextInt();
				if(set.size()!=k){
					set.add(z);
					
				}
			
				else{
					
					int val = arr[z-1];
					int index = min(set,arr);
					if(arr[z-1]>arr[index-1]){
						set.remove(index);
						set.add(z);
					}
				}
			}
			else{
				int z = input.nextInt();
				boolean condition = false;
				for(int b : set){
					
					if(z==b){
						System.out.println("YES");
						condition = true;
					}
				}
				if(!condition)System.out.println("NO");
				
			}
		}
	}
		
	

  private static int min(HashSet<Integer> set,int[]arr){
	  int min = Integer.MAX_VALUE;
		int index=-1;	  
			  
	  for(int i: set){
		  if(arr[i-1]<min){
			  min = arr[i-1];
		      index =i;
		  }
		  
	  }
	  return index;

}
  }
