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.File;
import java.io.FileInputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

/**
 * Created by dasha on 2/17/16.
 */
public class A {
    public static void main(String[] args) {
        new A().run();
    }

    Scanner in;
    public void run() {
        in = new Scanner(System.in);
        solve();

    }

    public void solve() {
        int n = in.nextInt();
        int k = in.nextInt();
        int q = in.nextInt();
        int[] fr = new int[n];
        HashMap<Integer, Integer> bond = new HashMap<>();
        for (int i = 0; i < n; i++) {
            fr[i] = in.nextInt();
            bond.put(fr[i], i);
        }
        int min = 0;
        int cur = 0;
        boolean[] are = new boolean[n];
        int[] cs = new int[k];
        Arrays.fill(cs, 1000000001);

        for (int i = 0; i < q; i++) {
            int query = in.nextInt();
            int id = in.nextInt() - 1;
            switch (query) {
                case 1:
                    if (fr[id] > min || cur < k) {
                        if (cur < k) {
                            are[id] = true;
                            cs[cur++] = fr[id];
                        }
                        else {
                            are[id] = true;
                            are[bond.get(min)] = false;
                            cs[0] = fr[id];
                        }
                        Arrays.sort(cs);
                        min = cs[0];
                    }
                    break;
                case 2:
                    System.out.println(are[id] ? "YES" : "NO");
                    break;
            }
        }
    }
}
