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.*;
import java.util.Scanner;
public class Main {
public static void main(String args[])throws IOException
{
	Scanner s1=new Scanner(System.in);
	int n=Integer.parseInt(s1.next());
	int k=Integer.parseInt(s1.next());
	int q=Integer.parseInt(s1.next());
	int power[]=new int[n];
	int online=0;
	if(k>6)
		k=6;
	int display[]=new int[k];
	for(int i=0;i<n;i++)
	{
		power[i]=Integer.parseInt(s1.next());
	}
    for(int i=0;i<q;i++)
    {
    	String no=s1.next();
    	if(no.equals("1"))
    	{
    	  int in=Integer.parseInt(s1.next());//no to b turned on
    	  if(online<k)
    	  {
    		  display[online]=in-1;
    		  online++;
    	  }
    	  else //find the one with lowest power and then replace him
    	  {
    		  int low=power[display[0]];
    		  int index=0;
    		  for(int j=1;j<k;j++)
    		  {
    			//  System.out.println(low+" "+power[display[j]]);
    			  if(power[display[j]]<low)
    			  {
    				  low=power[display[j]];
    				  index=j;
    			  }
    		  }
    		  
    		  if(low<power[in-1])
    		  {
    			  display[index]=in-1;
    		  }
    	  }
    	}
    	if(no.equals("2"))
    	{
    		  int in=Integer.parseInt(s1.next());//no to b turned on//search for the element
    		  int flag=0;
    		  for(int j=0;j<online;j++)
    		  {
    			  if(display[j]==in-1)
    				  {
    				  flag=1;
    				  System.out.println("YES");
    				  break;
    				  }
    		  }
    	//	  for(int j=0;j<k;j++)
    	//		  System.out.println(display[j]);
    		  if(flag==0)
    			  System.out.println("NO");
    	}
    }
}
}
