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.ArrayList;
import java.util.Collections;

public class CF {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        
    public static void main(String[] args) throws IOException {
        String[] split = br.readLine().split(" ");
        int k = Integer.parseInt(split[1]);
        int q = Integer.parseInt(split[2]);
        
        split = br.readLine().split(" ");
        int[] closeness = new int[split.length];
        for(int i = 0; i < split.length; i++)
            closeness[i] = Integer.parseInt(split[i]);
        
        ArrayList<Friend> friends = new ArrayList<Friend>();
        
        for(int z = 0; z < q; z++) {
            split = br.readLine().split(" ");
            int ind = Integer.parseInt(split[1]); //1-indexed
            
            if(split[0].equals("1")) {
                Friend friend = new Friend(ind, closeness[ind - 1]);
                friends.add(friend);
                
                if(friends.size() > k) {
                    Collections.sort(friends);
                    friends.remove(friends.size() - 1);
                }
            }
            else {
                boolean found = false;
                for(int i = 0; i < friends.size(); i++) {
                    if(friends.get(i).ind == ind) {
                        found = true;
                        break;
                    }
                }
                if(found) pw.println("YES");
                else pw.println("NO");
            }
        }
        
        pw.close();
    }
    public static class Friend implements Comparable<Friend> {
        int ind, closeness;
        
        public Friend(int i, int c) {
            ind = i;
            closeness = c;
        }
        
        @Override
        public int compareTo(Friend f) {
            return f.closeness - closeness;
        }
        
    }
}