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.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Locale;
import java.util.Scanner;
import java.util.TreeSet;

public class Main {

    public static void main(String[] args) throws IOException {
        Locale.setDefault(Locale.US);
//        BufferedReader entrada = new BufferedReader(new InputStreamReader(System.in));
//        BufferedReader entrada = new BufferedReader(new InputStreamReader(new FileInputStream("C:\\Users\\felipe.santos\\Documents\\entradas.txt")));;;
//        Scanner entrada = new Scanner(new FileInputStream("/home/felipe/entradas.txt"));//C:\Users\felipe.santos\Documents\
        Scanner entrada = new Scanner(System.in);
        BufferedWriter saida = new BufferedWriter(new OutputStreamWriter(System.out));
//        BufferedWriter saida = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("/home/felipe/saidas.txt")));
        int amigos = entrada.nextInt();
        int display = entrada.nextInt();
        int queries = entrada.nextInt();
        TreeSet<Integer> onlines = new TreeSet<>();
        TreeSet<Integer> pq = new TreeSet<>();
        int vetor[] = new int[amigos + 5];
        for (int i = 1; i <= amigos; i++) {
            vetor[i] = entrada.nextInt();
        }
        for (int i = 0; i < queries; i++) {
            int tipo = entrada.nextInt();
            int num = entrada.nextInt();
            if (tipo == 1) {
                onlines.add(vetor[num]);
                if (pq.size() < display) {
                    pq.add(vetor[num]);
                } else if (vetor[num] > pq.first()) {
                    pq.pollFirst();
                    pq.add(vetor[num]);
                }
            } else if (tipo == 2) {
                if (onlines.contains(vetor[num]) && vetor[num] >= pq.first()) {
                    saida.write("YES\n");
                } else {
                    saida.write("NO\n");
                }
            }
        }
        saida.flush();
    }

}
