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 javafx.geometry.Pos;
import javafx.util.Pair;

import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.security.cert.PolicyNode;
import java.util.*;

public class Solution {
    BufferedReader in;
    PrintWriter out;
    StringTokenizer st;

    String nextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }

    final int inf = Integer.MAX_VALUE / 2;
    final double eps = 0.0000000001;

    int rd() throws IOException {
        return Integer.parseInt(nextToken());
    }



    void solve() throws IOException {
        int n = rd();
        int k = rd();
        int q = rd();
        int[] t = new int[n];
        TreeSet<Integer> treeset = new TreeSet<>();
        for (int i = 0; i < n; i++){
            t[i] = rd();
        }
        for (int i = 0; i < q; i++){
            int type = rd();
            int id = rd() - 1;
            if (type == 1){
                treeset.add(t[id]);
                if (treeset.size() > k){
                    treeset.pollFirst();
                }
            } else {
                if (treeset.contains(t[id])){
                    out.println("YES");
                } else {
                    out.println("NO");
                }
            }
        }
    }


    void run() throws IOException {
        try {
//            in = new BufferedReader(new FileReader("notation.in"));
//            out = new PrintWriter("notation.out");
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
            Locale.setDefault(Locale.UK);
            solve();
        } catch (Exception e) {
            e.printStackTrace();//To change body of catch statement use File | Settings | File Templates.
        } finally {
            out.close();
        }
    }

    public static void main(String Args[]) throws IOException {
        new Solution().run();
    }
}