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.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

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

    static class TaskB {
        FastReader in;
        PrintWriter out;
        private final int BUFFER = 200005;
        private int[] tempints = new int[BUFFER];

        void set(FastReader in, PrintWriter out) {
            this.in = in;
            this.out = out;
        }

        public void solve(int testNumber, FastReader in, PrintWriter out) {
            set(in, out);
            int n = i();
            int k = i();
            int q = i();
            long ans = 0L;
            int arr[] = new int[8];
            int a[] = is(n);
            int size = 0;
            for (int qq = 1; qq <= q; qq++) {
                int type = i();
                int id = i();
                if (type == 1) {
                    if (arr[size] < a[id] || size < k) {
                        int i = 0;
                        for (i = size; i >= 1; i--) {
                            if (arr[i] < a[id]) arr[i + 1] = arr[i];
                            else break;
                        }
                        arr[i + 1] = a[id];
                        //      for(int j = 1 ; j <= size ; j++){
                        //         out.write(""+arr[j]+" ");
                        //      }
                        size = Math.min(size + 1, k);
                        //     out.write("qry "+qq+" size= "+size+"\n");
                    }
                } else {
                    int ch = 0;
                    for (int i = size; i >= 1; i--) {
                        if (arr[i] == a[id]) ch = 1;

                    }
                    if (ch == 1) {
                        out.write("YES\n");
                    } else {
                        out.write("NO\n");
                    }

                }
            }
            // out.write(""+ans+"");

        }

        int i() {
            //return Integer.parseInt(br.readLine().trim());
            return in.nextInt();
        }

        int[] is(int n) {
            //int arr[] = new int[n+1];
            for (int i = 1; i <= n; i++) tempints[i] = in.nextInt();
            return tempints;
        }

    }

    static class FastReader {
        private InputStream stream;
        private byte[] buf = new byte[4 * 1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public FastReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c == ',') {
                    c = read();
                }
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}

