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.StringTokenizer;
import java.util.TreeSet;

public class TaskA {
    StringTokenizer st;
    BufferedReader in;
    PrintWriter out;

    public static void main(String[] args) throws IOException {
        TaskA taskC = new TaskA();
        taskC.open();
        taskC.solve();
        taskC.close();
    }

    String nextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String str = in.readLine();
            if (str == null) return null;
            else st = new StringTokenizer(str);
        }
        return st.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    private void close() {
        out.close();
    }

    class Pair implements Comparable<Pair> {
        int cost, num;

        public Pair(int num) {
            this.cost = t[num];
            this.num = num;
        }

        @Override
        public int compareTo(Pair o) {
            return Integer.compare(cost, o.cost);
        }
    }

    int[] t;

    private void solve() throws IOException {
        int n = nextInt(), k = nextInt(), q = nextInt();
        t = new int[n];
        for (int i = 0; i < n; i++) {
            t[i] = nextInt();
        }
        TreeSet<Pair> slv = new TreeSet<>();
        for (int i = 0; i < q; i++) {
            if (nextInt() == 1) {
                slv.add(new Pair(nextInt() - 1));
                if (slv.size() > k) slv.pollFirst();
            } else {
                int cur = nextInt() - 1;
                out.println(slv.contains(new Pair(cur)) ? "YES" : "NO");
            }
        }
    }

    private void open() {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(new BufferedOutputStream(System.out));
    }

}