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.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;


public class MainS {
public static int x;
public static int y;
	public static void main(String[] args) {
	
		 @SuppressWarnings("resource")
			Scanner input = new Scanner(System.in);
			 int n = input.nextInt();
			 int k = input.nextInt();
			 int q = input.nextInt();
			//get  freindships ti values
			long[] freindsTi=new long[n];
			for(int z = 0 ;z<freindsTi.length;z++){
				freindsTi[z]=input.nextInt();
			}
			 //only k friends can be display at max
			List<Long> online=new ArrayList<Long>();
			List<Long> temp_online=new ArrayList<Long>();
			List<Long> offline=new ArrayList<Long>();
			 //if more than k are online , display = best friends 
			 //get id and type
			for(int i = 0 ; i < q ; i ++){
				int type=input.nextInt();
				int id = input.nextInt();
				//if type = 1 >> add to online
				if(type==1){
					online.add(freindsTi[id-1]);
					temp_online.add(freindsTi[id-1]);
					if(online.size()>k){
						Collections.sort(temp_online);
						for(int s =0;s<(online.size()-k);s++){
							online.remove(temp_online.get(s));
						}
					}
				}else{	
					int existID=0;
					if(online.indexOf(freindsTi[id-1])!=-1){
						existID=1;
					}
					if(existID==1){
						System.out.println("YES");
					}else{
						System.out.println("NO");
					}
				}
			}
		}	 
}
