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.util.Comparator;
import java.util.Iterator;
import java.util.PriorityQueue;
import java.util.Scanner;

/**
 * Created by WiNDWAY on 4/4/16.
 */
public class Codeforces_VKCup_2016_round_1_BearAndDisplayedFriends {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int k = input.nextInt();
        int q = input.nextInt();
        int[] friends = new int[n];
        for (int i = 0; i < n; i++) {
            friends[i] = input.nextInt();
        }
        PriorityQueue<Integer> queue = new PriorityQueue<>(k, new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return new Integer(friends[o1 - 1]).compareTo(friends[o2 - 1]);
            }
        });
        for (int i = 0; i < q; i++) {
            int type = input.nextInt();
            int friend = input.nextInt();
            if(type == 1) {
                if(queue.size() == k) {
                    queue.poll();
                }
                queue.add(friend);
            } else {
                boolean found = false;
                for(int current : queue) {
                    if(current == friend) {
                        found = true;
                        break;
                    }
                }
                if(found) {
                    System.out.println("YES");
                } else {
                    System.out.println("NO");
                }
            }
        }
    }
}
