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.util.*;

/**
 * Created by andrei on 28.03.2016.
 */
public class ProblemB {


    public static class Friend implements Comparable {
        private long relation;
        private int id;

        public Friend( int id, int relation ) {
            this.id = id;
            this.relation = relation;
        }

        public long getRelation(){
            return this.relation;
        }

        public int getId() {
            return this.id;
        }

        @Override
        public int compareTo( Object o ) {
            Friend comparison = (Friend)o;
            if (comparison.getRelation() < this.getRelation()) {
                return 1;
            } else if (comparison.getRelation() > this.getRelation()) {
                return -1;
            }
            return 0;
        }
    }

    public static void main( String[] args ) {
        Queue<Friend> bestFriends = new PriorityQueue<>( 1 );

        int n, k, q;
        java.util.Scanner sc = new java.util.Scanner(System.in);
        n = sc.nextInt();
        k = sc.nextInt();
        q = sc.nextInt();

        Friend[] friends = new Friend[n+1];
        for (int i = 1; i <= n; ++i) {
            friends[i] = new Friend(i,  sc.nextInt() );
        }

        long type;
        int id;
        Set<Integer> displayed = new HashSet<>(  );
        for (int i = 0; i < q; ++i) {
            //System.out.print( "Query " + i + " :  " );
            displayed.forEach( fr -> {
               // System.out.print( fr + "  " );
            } );
            //System.out.println();
            type = sc.nextInt();
            id = sc.nextInt();
            //System.out.println(type + "   " + id);
            if (type == 2) {
                if (displayed.contains( id )) {
                    System.out.println("YES");
                } else {
                    System.out.println("NO");
                }
            } else  {
                bestFriends.add( friends[id] );
                displayed.add( friends[id].getId() );
                if (displayed.size() > k ) {
                    displayed.remove( bestFriends.peek().getId() );
                }
            }
            //System.out.println();
        }
    }
}
