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.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;




public class Main {
  
    static int mod = 1000000007;
    
    
    
    public static void main(String[] args) throws IOException {
        
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new PrintWriter(System.out));
   
        String[] in = br.readLine().split(" ");
        
        int n = Integer.parseInt(in[0]);
        int k = Integer.parseInt(in[1]);
        int q = Integer.parseInt(in[2]);
        in=br.readLine().split(" ");
        int[] t = new int[n];
        for(int i=0;i<n;i++)    t[i] = Integer.parseInt(in[i]);
        int[] v = new int[n];
        ArrayList<Integer> C = new ArrayList<>(k);
        for(int i=0;i<q;i++){
            in = br.readLine().split(" ");
            int ty = Integer.parseInt(in[0]);
            int id= Integer.parseInt(in[1]);
            id-=1;
            
            if(ty==1){
                if(C.size() < k){
                    C.add(id);
                    v[id] = 1;
                }else{
                    Collections.sort(C, new Comparator<Integer>(){
                        @Override
                        public int compare(Integer x, Integer y) {
                            return t[x]-t[y];
                        }
                    });
                    int it = -1;
                    for(Integer item : C){
                        if(t[id] > t[item]){
                            it = item;
                            break;
                        }
                    }
                    
                    if(it != -1){
                        C.remove((Integer)it);
                        v[it] = 0;
                        v[id] = 1;
                        C.add(id);
                    }
                }
            }
            else{
                if(v[id] == 0)  bw.append("NO\n");
                else    bw.append("YES\n");
            }
        }
        
        bw.close();
        
    }
    
    
}