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.Scanner;

public class A {
    public static void main(String[] arg) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int k = scanner.nextInt();
        int q = scanner.nextInt();

        int[][] set = new int[n][2];
        int[] online = new int[k];
        int len = 0;

        for(int i = 0; i < n; i++) {
            set[i][0] = scanner.nextInt();
        }


        int minId = -1;
        int min = 1000000001;

        for(int i = 0; i < q; i++) {
            int type = scanner.nextInt();
            int id = scanner.nextInt() - 1;
            if(type == 2) {
                if(set[id][1] == 1) {
                    System.out.println("YES");
                } else {
                    System.out.println("NO");
                }
            } else {
                if(len == k) {
                    if(min < set[id][0]) {
                        set[online[minId]][1] = 0;
                        set[id][1] = 1;
                        online[minId] = id;
                        minId = 0;
                        min = set[online[0]][0];
                        for(int y = 1; y < k; y++) {
                            if(set[online[y]][0] < min) {
                                min = set[online[y]][0];
                                minId = y;
                            }
                        }
                    }
                } else {
                    online[len] = id;
                    set[id][1] = 1;
                    len++;
                    if(set[id][0] < min) {
                        min = set[id][0];
                        minId = len - 1;
                    }
                }
            }
        }
    }
}
