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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.TreeMap;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CF_658B solver = new CF_658B();
        solver.solve(1, in, out);
        out.close();
    }

    static class CF_658B {
        public void solve(int testNumber, InputReader input, PrintWriter out) {
            FastScanner in = new FastScanner(input);
            int n = in.i(), k = in.i(), q = in.i();
            int[] relation = in.arr(n);

            boolean[] online = new boolean[n];
            TreeMap<Integer, Integer> map = new TreeMap<>();
            for (int i = 0; i < q; ++i) {
                int type = in.i(), id = in.i() - 1;
                if (type == 1) {
                    map.put(relation[id], id);
                    online[id] = true;
                } else {
                    if (online[id])
                        out.println("YES");
                    else
                        out.println("NO");
                }
                while (map.size() > k) {
                    int low = map.firstKey();
                    int idx = map.get(low);
                    map.remove(low);
                    online[idx] = false;
                }
            }
        }

    }

    static class FastScanner {
        InputReader in;

        public FastScanner(InputReader in) {
            this.in = in;
        }

        public int i() {
            return in.nextInt();
        }

        public int[] arr(int n) {
            return arr(n, false);
        }

        public int[] arr(int n, boolean from1) {
            int[] a;
            if (from1) {
                a = new int[n + 1];
                for (int i = 1; i <= n; ++i) a[i] = in.nextInt();
            } else {
                a = new int[n];
                for (int i = 0; i < n; ++i) a[i] = in.nextInt();
            }
            return a;
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

