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;

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author Administrator
 */
public class A {
    public static int findMin(int[]array, int[] t) {
        int min = 1000000000 + 1;
        int minIndex = -1;
        for (int i = 0; i < array.length; i++) {
            if (array[i] == -1) {
                return i;
            }
            if (t[array[i]] < min) {
                min = t[array[i]];
                minIndex = i;
            }
        }
        return minIndex;
    }
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int k = scan.nextInt();
        int q = scan.nextInt();
        int[] t = new int[n + 1];
        for (int i = 1; i < n + 1; i++) {
            t[i] = scan.nextInt();
        }   
        int inW[] = new int[k];
        for (int i = 0; i < k; i++) {
            inW[i] = -1;
        }
        
        for (int i = 0; i < q; i++) {
            int type = scan.nextInt();
            int id = scan.nextInt();
            if (type == 1) {
                int minIndex = findMin(inW, t);
                if (inW[minIndex] == -1) {
                    inW[minIndex] = id;
                } else if (t[inW[minIndex]] < t[id]) {
                    inW[minIndex] = id;
                }
            } else {
                boolean flag = false;
                for (int j = 0; j < k; j++) {
                    if (inW[j] == id) {
                        flag = true;
                    }
                }
                if (flag) {
                    System.out.println("YES");
                } else {
                    System.out.println("NO");
                }
            }
        }
         
    }
}
