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 c1AlgorithmToolBox.week4DivideAndConquer;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Collections;
import java.util.PriorityQueue;

/**
 * Created by cscvenkatmadurai on 3/28/2016.
 */
public class BearandDisplayedFriends {
    public static void main(String[] args) throws IOException{
        BufferedReader kb = new BufferedReader(new InputStreamReader(System.in));
        int n,k,q,querry,id,friendsBond[];
        String ip[];
        ip = kb.readLine().split(" ");
        n = Integer.parseInt(ip[0]);
        k = Integer.parseInt(ip[1]);
        q = Integer.parseInt(ip[2]);
        friendsBond = new int[n];
        ip = kb.readLine().split(" ");
        for (int i = 0; i < n; i++) {
            friendsBond[i] = Integer.parseInt(ip[i]);
        }

        PriorityQueue<Integer> maxPQ = new PriorityQueue<Integer>(k );
        while(q-- > 0){
            ip = kb.readLine().split(" ");
            querry = Integer.parseInt(ip[0]);
            id = Integer.parseInt(ip[1]);
            if(querry == 1){
                if(maxPQ.size() < k){
                    maxPQ.add(friendsBond[id-1]);
                }else{
                    int peek = maxPQ.peek();
                    if(peek  < friendsBond[id-1]){
                        maxPQ.remove();
                        maxPQ.add(friendsBond[id-1]);
                    }
                }
            }else{
                if(maxPQ.contains(friendsBond[id-1])){
                    System.out.println("YES");
                }else{
                    System.out.println("NO");
                }
            }
        }
    }
}
