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 VkCup_part1_taskA {
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int q = in.nextInt();
        int[] friend = new int[n+1];
        for (int i = 1; i <= n; i++){
            friend[i] = in.nextInt();
        }
        int[][] online = new int[k][2];
        for (int i = 0; i < q; i++){
            int type = in.nextInt();
            if (type == 1){
                int x  = in.nextInt();
                magic(online,k,friend[x],x);
            }else{
                int x = in.nextInt();
                boolean c = false;
                for (int j = 0;j < k; j++){
                    if (online[j][1]==x){
                        c = true;
                        break;
                    }
                }
                if (c){
                    System.out.println("YES");
                }else{
                    System.out.println("NO");
                }
            }
        }
    }

    public static int magic(int[][] online, int k,int friend,int id) {
        for (int i = 0; i < k; i++){
            if (online[i][0]<friend){
                int buf = online[i][0];
                int bufid = online[i][1];
                online[i][0] = friend;
                online[i][1] = id;
                if (buf > online[k-1][0]){
                    magic(online,k,buf,bufid);
                    return 0;
                }else{
                    break;
                }
            }
        }
        return 0;
    }
}
