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.HashSet;
import java.util.PriorityQueue;
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
 *
 * @author lebegio
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyReader in = new MyReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, MyReader in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();
            int q = in.nextInt();
            int[] t = new int[n];
            for (int i = 0; i < n; i++) {
                t[i] = in.nextInt();
            }
            int[] type = new int[q];
            int[] id = new int[q];
            PriorityQueue<Pair> que = new PriorityQueue<>((o1, o2) -> {
                return Long.compare(o1.x, o2.x);
            });
            HashSet<Integer> isIn = new HashSet<>();

            for (int i = 0; i < q; i++) {
                type[i] = in.nextInt();
                id[i] = in.nextInt();
            }

            for (int i = 0; i < q; i++) {
                if (type[i] == 1) {
                    que.add(new Pair(t[id[i] - 1], id[i]));
                    isIn.add(id[i]);
                    if (que.size() > k) {
                        isIn.remove(que.poll().y);
                    }
                } else {
                    out.println(isIn.contains(id[i]) ? "YES" : "NO");
                }
            }
        }

    }

    static class MyReader {
        private BufferedReader buffReader;
        private StringTokenizer strTokenizer;
        private static final int SIZE = 32768;

        public MyReader(InputStream inputStream) {
            buffReader = new BufferedReader(new InputStreamReader(inputStream), SIZE);
        }

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

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

    }

    static class Pair {
        public int poz = 0;
        public long x = 0;
        public int y = 0;

        public Pair(int xx, int yy) {
            this.x = xx;
            this.y = yy;
        }

        public Pair(int xx, int yy, int poz) {
            this.x = xx;
            this.y = yy;
            this.poz = poz;
        }

    }
}

