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.io.IOException;
import java.io.InputStreamReader;
import java.util.TreeSet;
import java.io.FileNotFoundException;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.FileReader;
import java.util.Comparator;
import java.io.InputStream;

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

    static class TaskA {
        public void solve(int testNumber, IOReader in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();
            int q = in.nextInt();
            int[] t = in.readIntArray(n);
            TreeSet<Integer> fs = new TreeSet<>(new Comparator<Integer>() {

                public int compare(Integer o1, Integer o2) {
                    return -Integer.compare(t[o1], t[o2]);
                }
            });
            StringBuilder builder = new StringBuilder();
            for (int i = 0; i < q; i++) {
                int type = in.nextInt();
                int id = in.nextInt() - 1;
                if (type == 1) {

                    if (fs.size() < k || t[id] > t[fs.last()]) {
                        fs.add(id);
                    }

                    if (fs.size() > k) {
                        fs.pollLast();
                    }

                } else {
                    builder.append(fs.contains(id) ? "YES" : "NO").append('\n');
                }
            }
            out.println(builder);
        }

    }

    static class IOReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

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

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

        public int[] readIntArray(int count) {
            int[] array = new int[count];
            for (int i = 0; i < count; i++) {
                array[i] = nextInt();
            }
            return array;
        }

        private IOReader(BufferedReader bufferedReader) {
            reader = bufferedReader;
        }

        public IOReader(String filename) {
            try {
                reader = new BufferedReader(new FileReader(filename));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        public IOReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
        }

    }
}

