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 com.sun.org.apache.bcel.internal.generic.AALOAD;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
import java.util.stream.IntStream;
import javafx.util.Pair;

public class Main
{

    static void sort(int a[])
    {
        Random ran = new Random();
        for (int i = 0; i < a.length; i++) {
            int r = ran.nextInt(a.length);
            int temp = a[r];
            a[r] = a[i];
            a[i] = temp;
        }

        Arrays.sort(a);
    }
    static int a[];

   
    public static class  Check
    {
        int a;
        int b;

        public Check(int a, int b)
        {
            this.a = a;
            this.b = b;
        }
          
        
    }

    public static void main(String[] args) throws IOException
    {

        Scanner input = new Scanner(System.in);
      int n  = input.nextInt();
      int k = input.nextInt();
      int q = input.nextInt();
      int a[] = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = input.nextInt();
        }
        TreeSet<Integer> set = new TreeSet<>();
        StringBuilder ans  = new StringBuilder();
        
        for (int i = 0; i < q; i++) {
            int x = input.nextInt();
            int index = input.nextInt()-1;
            if(x==1)
            {
                if(set.size()<k)
                {
                    set.add(a[index]);
                    
                }
                else
                {
                    if(set.first()<a[index])
                    {
                        set.pollFirst();
                        set.add(a[index]);
                    }
                    
                }
            }
            else
            {
                if(set.contains(a[index])) 
                {
                    ans.append("YES\n");
                }
                else
                {
                    ans.append("NO\n");
                }
            }
        }
        System.out.println(ans
        
        );
        
              
               
       
    }

}
