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

//package codeforces;

import java.util.Scanner;
import java.util.TreeSet;

/**
 * Created by nitin.s on 28/03/16.
 */
public class BearAndDisplayedFriends {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(), k = in.nextInt(), q = in.nextInt();
        int[] t = new int[n + 1];
        for(int i = 1; i <= n; ++i) {
            t[i] = in.nextInt();
        }
        in.nextLine();
        TreeSet<Integer> set = new TreeSet<Integer>();
        StringBuilder answer = new StringBuilder();
        for(int i = 0; i < q; ++i) {
            String[] split = in.nextLine().split(" ");
            int type = Integer.parseInt(split[0]);
            int id = Integer.parseInt(split[1]);
            if(type == 1) {
                if(set.isEmpty()) {
                    set.add(t[id]);
                } else {
                    if(set.size() < k) {
                        set.add(t[id]);
                    } else {
                        int first = set.first();
                        if (first < t[id]) {
                            set.remove(first);
                            set.add(t[id]);
                        }
                    }
                }
            } else {
                if(set.contains(t[id])) {
                    answer.append("YES\n");
                } else {
                    answer.append("NO\n");
                }
            }
        }
        System.out.println(answer.toString());
    }
}
