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

/*
Keep solving problems. 
*/
import java.util.*;
import java.io.*;

public class VK2016B {

    BufferedReader br;
    PrintWriter out;
    StringTokenizer st;
    boolean eof;
    final long MOD = 1000L * 1000L * 1000L + 7;
    class Friend implements Comparable<Friend> {
        int id;
        int val;
        public Friend(int id, int val) {
            this.id = id;
            this.val = val;
        }
        @Override
        public int compareTo(Friend o) {
            return Integer.compare(this.val, o.val);
        }
    }
    void solve() throws IOException {
        int n = nextInt();
        int k = nextInt();
        int q = nextInt();

        int[] t = nextIntArr(n);
        PriorityQueue<Friend> pq = new PriorityQueue<>();
        List<String> res = new ArrayList<>();
        for(int i = 0; i < q; i++) {
            int type = nextInt();
            int id = nextInt() - 1;
            Friend fd = new Friend(id, t[id]);
            if(type == 1) {
                pq.add(fd);
                if(pq.size() > k) {
                    pq.poll();
                }
            }
            else {
                boolean tmp = false;
                for(Friend f : pq) {
                    if(f.id == id) {
                        tmp = true;
                        break;
                    }
                }
                if(tmp) {
                    res.add("YES");
                }
                else {
                    res.add("NO");
                }
            }
        }
        for(String s : res) {
            outln(s);
        }
    }
    void shuffle(int[] a) {
        int n = a.length;
        for(int i = 0; i < n; i++) {
            int r = i + (int) (Math.random() * (n - i));
            int tmp = a[i];
            a[i] = a[r];
            a[r] = tmp;
        }
    }
    private void outln(Object o) {
        out.println(o);
    }
    private void out(Object o) {
        out.print(o);
    }
    public VK2016B() throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        solve();
        out.close();
    }
    public static void main(String[] args) throws IOException {
        new VK2016B();
    }

    public long[] nextLongArr(int n) throws IOException{
        long[] res = new long[n];
        for(int i = 0; i < n; i++)
            res[i] = nextLong();
        return res;
    }
    public int[] nextIntArr(int n) throws IOException {
        int[] res = new int[n];
        for(int i = 0; i < n; i++)
            res[i] = nextInt();
        return res;
    }
    public String nextToken() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                eof = true;
                return null;
            }
        }
        return st.nextToken();
    }
    public String nextString() {
        try {
            return br.readLine();
        } catch (IOException e) {
            eof = true;
            return null;
        }
    }
    public int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }
    public long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
    public double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
}

