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.company;

import  java.util.*;
import java.io.*;
import java.lang.Math;

public class ProblemB {

    public static void main(String[] args) {

        new ProblemB().run();
    }


    Scanner in;
    PrintWriter out;

    ProblemB() {

        in = new Scanner(System.in);
        out = new PrintWriter(System.out);
    }

    void run() {
        solve();
        out.close();
    }

    void solve() {
        int n = in.nextInt();
        int k = in.nextInt();
        int q = in.nextInt();

        int[] mas_like = new int[n];
        int[] mas_online = new int[k];

        for (int i=0;i<k;i++){
            mas_online[i]=-1;
        }
        for (int i=0;i<n;i++){
            mas_like[i]=in.nextInt();
        }
        for (int i=0;i<q;i++){
            if (in.nextInt()==1){
                int a = in.nextInt();
                mas_online = insert(mas_like,mas_online,a,k);
            }
            else{
                if (contains(mas_online,in.nextInt())){
                    out.println("YES");
                }
                else
                    out.println("NO");
            }
        }
    }

    int[] insert (int[] mas_like,int[] mas_online, int a,int k){
        k--;
        if (mas_online[k]==-1) {
            int i = 0;
            while (i <= k&&mas_online[i]!=-1){
                i++;
            }
            mas_online[i]=a;

            while ( i > 0&&mas_like[mas_online[i] - 1] > mas_like[mas_online[i - 1] - 1] ) {
                int r = mas_online[i - 1];
                mas_online[i - 1] = mas_online[i];
                mas_online[i] = r;
                i--;
            }
        }
        else{
            if (mas_like[a - 1] > mas_like[mas_online[k] - 1]) {
                mas_online[k] = a;
                int i = k - 1;
                    while (i > 0&&mas_like[mas_online[i] - 1] > mas_like[mas_online[i - 1] - 1]) {
                    int r = mas_online[i - 1];
                    mas_online[i - 1] = mas_online[i];
                    mas_online[i] = r;
                    i--;
                }

            }
        }


        return mas_online;
    }

    boolean contains(int[] arr, int item) {
        for (int n : arr) {
            if (item == n) {
                return true;
            }
        }
        return false;
    }

}

