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.List;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author AlexFetisov
 */
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);
        TaskB_VK1 solver = new TaskB_VK1();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB_VK1 {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();
            int countQ = in.nextInt();
            int[] t = Utils.readIntArray(in, n);
            List<Integer> friends = new ArrayList<Integer>();
            while (countQ-- > 0) {
                int type = in.nextInt();
                int x = in.nextInt() - 1;
                if (type == 1) {
                    if (friends.size() < k) {
                        friends.add(x);
                    } else {
                        int id = -1;
                        for (int i = 0; i < friends.size(); ++i) {
                            if (id == -1 || t[friends.get(id)] > t[friends.get(i)]) {
                                id = i;
                            }
                        }
                        if (t[friends.get(id)] < t[x]) {
                            friends.set(id, x);
                        }
                    }
                } else {
                    boolean have = false;
                    for (int i : friends)
                        if (i == x) {
                            have = true;
                            break;
                        }
                    if (have) {
                        out.println("YES");
                    } else {
                        out.println("NO");
                    }
                }
            }
        }

    }

    static class Utils {
        public static int[] readIntArray(InputReader in, int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; ++i) {
                a[i] = in.nextInt();
            }
            return a;
        }

    }

    static class InputReader {
        private BufferedReader reader;
        private StringTokenizer stt;

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

        public String nextLine() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                return null;
            }
        }

        public String nextString() {
            while (stt == null || !stt.hasMoreTokens()) {
                stt = new StringTokenizer(nextLine());
            }
            return stt.nextToken();
        }

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

    }
}

