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.*;
import java.math.BigInteger;
import java.time.YearMonth;
import java.util.*;

public class Main {
    static boolean local = false;
    static FReader sc;
    static PrintWriter pw;

    public static void main(String args[]) throws FileNotFoundException {
        if (args.length != 0) {
            local = true;
            sc = new FReader("/Users/qjex/prj/jolymp/src/input.txt");
            try {
                pw = new PrintWriter(new FileOutputStream("/Users/qjex/prj/jolymp/src/output.txt"), false);
            } catch (Exception e) {
                e.printStackTrace();
            }
        } else {
            sc = new FReader(System.in);
            pw = new PrintWriter(System.out);
        }
        solve();
        pw.close();
        sc.close();
    }

    public static void solve() {
        int n = sc.nextInt(), k = sc.nextInt(), q = sc.nextInt();
        int t[] = new int[n];
        for (int i = 0; i < n; i++) t[i] = sc.nextInt();
        TreeSet<Integer> all = new TreeSet<>((Integer a, Integer b) -> (b.compareTo(a)));
        for (; q > 0; q--) {
            int type = sc.nextInt(), x = sc.nextInt();
            if (type == 2) {
                int it = 0;
                boolean ex = false;
                for (Integer a : all) {
                    if (it == k) break;
                    if (t[x - 1] == a) ex = true;
                    it++;
                }
                pw.println(ex ? "YES" : "NO");
            } else {
                all.add(t[x - 1]);
            }
        }

    }

}

class FReader {
    BufferedReader br;
    StringTokenizer st;

    FReader(String file) {
        try {
            br = new BufferedReader(new FileReader(file));
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
        st = new StringTokenizer("");
    }


    FReader(InputStream is) {
        br = new BufferedReader(new InputStreamReader(is));
        st = new StringTokenizer("");
    }

    String next() {
        try {
            while (!st.hasMoreElements()) {
                st = new StringTokenizer(br.readLine());
            }
        } catch (Exception e) {
            e.printStackTrace();
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    BigInteger nextBigInteger(){ return new BigInteger(next()); }

    public void close() {
        try {
            br.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }
}

class Pair implements Comparable<Pair> {

    public int first;
    public int second;

    public Pair(int first, int second) {
        this.first = first;
        this.second = second;
    }

    @Override
    public int compareTo(Pair pairInt) {
        if (first > pairInt.first) return 1;
        if (first < pairInt.first) return -1;
        if (second > pairInt.second) return 1;
        return second == pairInt.second ? 0 : -1;
    }

    @Override
    public boolean equals(Object obj) {
        return obj instanceof Pair && compareTo((Pair) obj) == 0;
    }
}