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 first {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String firstLine = scanner.nextLine();
        String[] firstArr = firstLine.split(" ");
        int n = Integer.parseInt(firstArr[0]);
        int k = Integer.parseInt(firstArr[1]);
        int q = Integer.parseInt(firstArr[2]);

        String lol = scanner.nextLine();
        String[] priorities = lol.split(" ");
        HashMap<Integer, Integer> users = new HashMap<>(n);
        for (int i = 0; i < priorities.length; i++) {
            users.put(Integer.parseInt(priorities[i]), i+1);
        }

        Set<Integer> window = new TreeSet<Integer>();
        for (int i = 0; i < q; i++) {
            String query = scanner.nextLine();
            String[] params = query.split(" ");
            int type = Integer.parseInt(params[0]);
            int id = Integer.parseInt(params[1]);
            if(type == 1){
                window.add(id);
                if(window.size() > k){
                    window.remove(window.iterator().next());
                }
            }
            else if(type == 2) {
                if(window.contains(id))
                    System.out.println("YES");
                else System.out.println("NO");
            }
        }


    }
}
