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 Main {


    private static void solve() throws IOException {
        int n = nextInt();
        int k = nextInt();
        int q = nextInt();

        Comp comp = new Comp();
        PriorityQueue<Friend> queue = new PriorityQueue<Friend>(k, comp);

        int[] a = new int[n];
        Friend[] friends = new Friend[k];

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

        for (int i = 0; i < q; i++) {
            int p = nextInt();
            int id = nextInt();
            Friend newFriend = new Friend(id, a[id - 1]);
            if (p == 1) {
                if (queue.size() < k) {
                    queue.add(newFriend);
                } else {
                    Friend small = queue.peek();
                    if (small.status < newFriend.status) {
                        queue.poll();
                        queue.add(newFriend);
                    }
                }
            } else {
                queue.toArray(friends);
                boolean yes = false;
                for (int l = 0; l < queue.size(); l++) {
                    if (friends[l].number == newFriend.number) {
                        yes = true;
                    }
                }
                if (yes) {
                    out.println("YES");
                } else {
                    out.println("NO");
                }
            }
        }

    }

    public static void main(String[] args) throws Exception {
        File file = new File("System.in");
        InputStream input = System.in;
        PrintStream output = System.out;
        if (file.exists() && file.canRead()) {
            input = new FileInputStream(file);
            output = new PrintStream("System.out");
        }
        br = new BufferedReader(new InputStreamReader(input));
        out = new PrintWriter(output);
        solve();
        out.close();
    }

    private static BufferedReader br;
    private static StringTokenizer st;
    private static PrintWriter out;

    private static boolean hasNextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String line = br.readLine();
            if (line == null) {
                return false;
            }
            st = new StringTokenizer(line);
        }
        return true;
    }

    private static String nextToken() throws IOException {
        return hasNextToken() ? st.nextToken() : null;
    }

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

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

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

}

class Comp implements Comparator<Friend> {

    @Override
    public int compare(Friend o1, Friend o2) {
        if (o1 != null && o2 != null && o1.status < o2.status) return -1;
        else if (o1 != null && o2 != null && o1.number == o2.number) return 0;
        else return 1;
    }
}


class Friend {
    int number;
    int status;

    Friend(int o, int t) {
        number = o;
        status = t;
    }
}
