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

/* package whatever; // don't place package name! */
 
import java.util.*;
import java.lang.*;
import java.io.*;
 
/* Name of the class has to be "Main" only if the class is public. */
public class bbg
{
	public static int result;
 
public static ArrayList<Integer> [] graph;
 
public static int[]cats;
 
public static int vizitat[];
public static int x;
 
 
	public static void main (String[] args) throws java.lang.Exception
{
 
Scanner input=new Scanner(System.in);
 
HashMap<Integer, Integer> map= new HashMap<Integer, Integer>();
HashMap<String, Integer> map2= new HashMap<String, Integer>();
 
		
		
	
	
		            	int n=input.nextInt();
				
					int k=input.nextInt();
					
					
					
					
					
					int q=input.nextInt();
					
					
					int []v=new int[n+1];
					
					for(int i=1;i<=n;i++) v[i]=input.nextInt();
					
					for(int i=1;i<=q;i++){
					
					
					int a=input.nextInt();
					int b=input.nextInt();
					
					
					if(a==1){
					 if(map.size()<=k) { map.put(b,v[b]);
					 
				//	 System.out.println(b+" "+v[b]);
				//	 System.out.println("map size="+map.size());
					 
					 
					 
					 }
						
						
						
						
						
						
					 if(map.size()>k) {
							
							int minimum=Integer.MAX_VALUE;
							int pozitie=-1;
							
							
						//	System.out.println("depasire");
							
							for(int x:map.keySet())
							{
								
								if(map.get(x)<minimum) 
								{minimum=map.get(x);
								
								
								pozitie=x;
							//	   System.out.println("minimum="+x+" "+map.get(x));
								}
								
								
							}
							
							map.remove(pozitie);
							
						//	for(int j:map.keySet())
						//	System.out.print(j+" ");
							
							
						}
						
					
					
					}
					
					else if(a==2) 
					
					
					{if(map.containsKey(b)) System.out.println("YES");
					else System.out.println("NO");}
						
						
						
						
					
					
					
					
					}
					
				
					
				
					
	
}
 
			}