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

public class A {

    public static StringTokenizer tokenizer = null;
    public static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

    public static String nextToken() throws IOException {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

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

    public static long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    public static double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    public static class Pair implements Comparable<Pair> {
        public int index;
        public int value;

        public Pair(int index, int value) {
            this.index = index;
            this.value = value;
        }

        @Override
        public int compareTo(Pair o) {
            if (this.value == o.value) {
                return Integer.compare(this.index, o.index);
            } else {
                return Integer.compare(this.value, o.value);
            }
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;

            Pair pair = (Pair) o;

            if (index != pair.index) return false;
            return value == pair.value;

        }

        @Override
        public int hashCode() {
            int result = index;
            result = 31 * result + value;
            return result;
        }
    }

    public static void main(String[] args) throws IOException {
        int n = nextInt();
        int k = nextInt();
        int q = nextInt();

        int[] t = new int[n];
        for (int i = 0; i < n; i++) {
            t[i] = nextInt();
        }

        TreeSet<Pair> set = new TreeSet<>();
        StringBuilder builder = new StringBuilder();
        for (int i = 0; i < q; i++) {
            int op = nextInt();
            int index = nextInt() - 1;
            if (op == 1) {
                set.add(new Pair(index, t[index]));
                if (set.size() > k) {
                    Pair left = set.first();
                    set.remove(left);
                }
            } else {
                Pair pairToFind = new Pair(index, t[index]);
                if (set.contains(pairToFind)) {
                    builder.append("YES\n");
                } else {
                    builder.append("NO\n");
                }
            }
        }
        System.out.println(builder.toString());
    }

}