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.io.*;
import java.util.*;
import java.text.*;
import java.math.*;

public class main {
    public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    public static PrintWriter pw = new PrintWriter(System.out);
    public static String line;
    public static StringTokenizer st;
    public static ArrayList<ArrayList<Integer>> adjList;
    public static int[] dx = {-1, -1, -1, 0, 1, 1, 1, 0};
    public static int[] dy = {-1, 0, 1, 1, 1, 0, -1, -1};

    public static void main(String[] args) throws Exception{
        st = new StringTokenizer(br.readLine());
        int N = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());
        int q = Integer.parseInt(st.nextToken());

        int[] t = new int[N];
        st = new StringTokenizer(br.readLine());
        for(int i = 0; i < N; i++){
            t[i] = Integer.parseInt(st.nextToken());
        }

        PriorityQueue<Integer> PQ = new PriorityQueue<Integer>();

        for(int i = 0; i < q; i++){
            st = new StringTokenizer(br.readLine());
            int type = Integer.parseInt(st.nextToken());
            int num = Integer.parseInt(st.nextToken()) - 1;
            if(type == 1){
                PQ.add(-t[num]);
            } else{
                // System.out.println(PQ);
                boolean f = false;
                ArrayList<Integer> M = new ArrayList<Integer>();
                int min = Math.min(k, PQ.size());
                for(int j = 0; j < min; j++){
                    int m = PQ.poll();
                    M.add(m);
                    if(m == -t[num]){
                        f = true;
                        break;
                    }
                }

                for(int j = 0; j < M.size(); j++){
                    PQ.add(M.get(j));
                }

                pw.print(f ? "YES\n" : "NO\n");
            }
        }
        pw.close();
        br.close();
    }
}
