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

//package com.qwert2603.vk_cup_r1;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

//import static com.qwert2603.first.CommonUtils.p;

public class Task1 {


    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] ns = br.readLine().split(" ");
        int n = Integer.parseInt(ns[0]);
        int k = Integer.parseInt(ns[1]);
        int q = Integer.parseInt(ns[2]);
        String[] s = br.readLine().split(" ");
        int[] fr = new int[n];
        for (int i = 0; i < n; i++) {
            fr[i] = Integer.parseInt(s[i]);
        }
        StringBuilder stringBuilder = new StringBuilder();
        List<Integer> wind = new ArrayList<>();
        for (int i = 0; i < q; i++) {
            String[] reqs = br.readLine().split(" ");
            int rq_n = Integer.parseInt(reqs[0]);
            int fr_n = Integer.parseInt(reqs[1]);
            if (rq_n == 1) {
                wind.add(fr_n);
                Collections.sort(wind, (o1, o2) -> Integer.compare(fr[o2-1], fr[o1-1]));
                for (int j = 0; j < wind.size() - Math.min(k, wind.size()); j++) {
                    wind.remove(wind.size()-1);
                }
            }
            else {
                stringBuilder.append(wind.indexOf(fr_n) >= 0 ? "YES" : "NO").append("\n");
            }
        }
        System.out.print(stringBuilder.toString());
    }

}
