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.HashMap;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Scanner;

public class Main {
    public static void main( String[] args ) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int q = sc.nextInt();
        Map<Integer,Integer> freind = new HashMap<Integer, Integer>();
        Map<Integer, Integer> anti = new HashMap<Integer, Integer>();
        for (int i = 0; i < n; i++) {
            int tmp = sc.nextInt();
            freind.put(i + 1, tmp);
            anti.put(tmp,i+1);
        }
        PriorityQueue <Integer> queue = new PriorityQueue<Integer>();
        for (int i = 0; i < q; i++) {
            int id = sc.nextInt();
            int number = sc.nextInt();
            if (id == 1) {
                queue.add(freind.get(number));
                if (queue.size() > k) anti.remove(queue.remove());
            }
            if (id == 2) {
                boolean usl = false;
                for (Integer level :queue) {
                    if (freind.get(number) == level) {
                        System.out.println("YES");
                        usl = true;
                    }
                }
                if (!usl) System.out.println("NO");
             }
        }

    }
}
