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.*;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException{
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task {

        private int getIndex(Long v, List<Long> list){
            for (int i = 0; i < list.size(); i++) {
                if (v.equals(list.get(i))) return i;
            }
            return -1;
        }

        public void solve(int testNumber, InputReader in, PrintWriter out) throws IOException {
            int n = in.nextInt();
            int k = in.nextInt();
            int q = in.nextInt();
            int[] friends = in.nextInts(n);
            PriorityQueue<Friend> win = new PriorityQueue<>(Comparator.comparing(Friend::getT));
            boolean[] showed = new boolean[n + 1];

            for (int i = 0; i < q; i++) {
                int type = in.nextInt();
                int id = in.nextInt();

                if (1 == type){
                    Friend friend = new Friend(id, friends[id - 1]);
                    if (win.size() < k){
                        win.add(friend);
                        showed[id] = true;
                    }else if(win.peek().t < friend.t){
                        win.add(friend);
                        showed[id] = true;
                        showed[win.remove().id] = false;
                    }
                }else{
                    out.println(showed[id] ? "YES" : "NO");
                }
            }
        }
    }


    static class Friend {
        int id;
        int t;

        public Friend(int id, int t) {
            this.id = id;
            this.t = t;
        }

        public int getT() {
            return t;
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

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

        public int[] nextInts(int n) throws IOException {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }

    }
}
