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.*;
import java.io.*;

public class BearAndDisplayedFriends{
   public static void main(String[] args) throws IOException{
      BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
   
      StringTokenizer tk = new StringTokenizer(f.readLine());
      int n = Integer.parseInt(tk.nextToken());
      int k = Integer.parseInt(tk.nextToken());
      int q = Integer.parseInt(tk.nextToken());
      
      int[] onOrNot = new int[n];
      int[] t = new int[n];
      tk = new StringTokenizer(f.readLine());
      for(int j = 0; j < n ; j++){
         t[j] = Integer.parseInt(tk.nextToken());
      }
   
      int[] online = new int[k];
   
      for(int qnum = q; qnum --> 0;){
         // for (int j =0; j < k; j++)
      //       System.out.print(online[j] + " ");
      //    System.out.println();
         tk = new StringTokenizer(f.readLine());
         if(tk.nextToken().equals("1")){
            int p = Integer.parseInt(tk.nextToken())-1;
            updateList(online, t[p]); // the t value of the person to add
            onOrNot[p] = 1;
         }
         else{
            int p = Integer.parseInt(tk.nextToken())-1;
            if (onOrNot[p] == 1 && isOnline(online, t[p]))
               System.out.println("YES");
            else
               System.out.println("NO");
         }
      }
   
   }

   private static boolean isOnline(int[] lst, int t){
      if(t >= lst[lst.length-1])
         return true;
      return false;
   }
   
   private static void updateList(int[] lst, int t){
      int i = lst.length;
      while( --i > 0 && lst[i] < t){
         lst[i] = lst[i-1];
      }
      if(t > lst[i])
         lst[i] = t;
      else if(i < lst.length-1)
         lst[i+1] = t;
   }
}