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.util.*;
import java.io.*;

public class A {
    FastScanner in;
    PrintWriter out;

    private static class Pair implements Comparable<Pair> {
        int f, s;

        public Pair(int f, int s) {
            this.f = f;
            this.s = s;
        }

        @Override
        public int compareTo(Pair o) {
            if (f == o.f) return Integer.compare(s, o.s);
            return Integer.compare(o.f, f);
        }
    }

    public void solve() throws IOException {
        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();
        }
        SortedSet<Pair> set = new TreeSet<>();
        for (int i = 0; i < q; i++) {
            int op = in.nextInt();
            int id = in.nextInt();
            switch (op) {
                case 1:
                    set.add(new Pair(t[id - 1], id));
                    break;
                case 2:
                    Iterator<Pair> it = set.iterator();
                    int itNum = 0;
                    boolean met = false;
                    while (it.hasNext() && itNum < k) {
                        Pair p = it.next();
                        if (p.s == id) {
                            met = true;
                            break;
                        }
                        itNum++;
                    }
                    if (met) {
                        out.println("YES");
                    } else {
                        out.println("NO");
                    }
                    break;
                default:
                    throw new UnsupportedOperationException();
            }
        }
    }

    public void run() {
        try {
            in = new FastScanner(System.in);
            out = new PrintWriter(System.out);

            solve();

            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(InputStream is) {
            br = new BufferedReader(new InputStreamReader(is));
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

    public static void main(String[] arg) {
        new A().run();
    }
}