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.*;
public class b {
  static Scanner input=new Scanner(System.in);
  public static void main(String kolodets[]) {
    int n=input.nextInt(),k=input.nextInt(),q=input.nextInt();
    int[] t=new int[n];
    for(int i=0;i<n;i++)
      t[i]=input.nextInt();
    StringBuilder sb=new StringBuilder();
    TreeSet<Integer> tree=new TreeSet<Integer>();
    for(int i=0;i<q;i++) {
      int ty=input.nextInt();
      int id=input.nextInt();
      if(ty==1) {
        if(tree.isEmpty())
          tree.add(t[id-1]);
        else if(tree.size()<k)
          tree.add(t[id-1]);
        else if(tree.size()>=k) {
          if(t[id-1]>tree.first()) {
            tree.add(t[id-1]);
            tree.remove(tree.first());
          }
        }
      }
      else  {
        sb.append(tree.contains(t[id-1])?"YES\n":"NO\n");
      }
    }
    System.out.println(sb);
  }
}