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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;

/**
 * Created by ramzamzam on 28.03.16.
 */
public class A {
    public static void main(String[] args) throws IOException{
        BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
        String[] str = r.readLine().split(" ");

        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(str[0]);
        int k = Integer.parseInt(str[1]);
        int q = Integer.parseInt(str[2]);
        List<Integer> friends = new ArrayList<>();

        PriorityQueue<Integer> queue = new PriorityQueue<>();
        str = r.readLine().split(" ");
        for (int i = 0; i < n; i++) {
            friends.add(Integer.parseInt(str[i]));
        }

        StringBuilder s = new StringBuilder();
        for (int i = 0; i < q; i++) {
            str = r.readLine().split(" ");
            int command = Integer.parseInt(str[0]);
            int friend = Integer.parseInt(str[1]);
            if (command == 1) {
                queue.add(friends.get(friend - 1));
                if (queue.size() > k) {
                    queue.poll();
                }
            } else {
                if(queue.contains(friends.get(friend-1))) {
                    s.append("YES\n");
                } else {
                    s.append("NO\n");
                }
            }

        }
        System.out.print(s.toString());

    }
}
