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 bearanddisplayfriend_vkcup2016;

import java.util.*;

public class BearAndDisplayFriend_VkCup2016 {

    public static int n, k, q, m, nItem;
    public static int[] t = new int[150005];
    public static int[] List = new int[150005];
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        m = 0; nItem = 0;
        
        n = sc.nextInt();
        k = sc.nextInt();
        q = sc.nextInt();
        for(int i = 1; i <= n; i++) t[i] = sc.nextInt();
        for(int i = 1; i <= q; i++){
            int type, id;
            type = sc.nextInt(); 
            id = sc.nextInt();
            if(type == 1){
                if(m < k) 
                {
                    m++;
                    List[m] = id;
                } else {
                    int Min = 1000000009, Pos = 1;
                    for(int j = 1; j <= m; j++) if(t[List[j]] < Min){
                        Pos = j;
                        Min = t[List[j]];
                    }
                    if(Min < t[id]) List[Pos] = id;
                }
            } else {
                boolean Found = false;
                for(int j = 1; j <= m; j++) if(List[j] == id){
                    System.out.println("YES");
                    Found = true;
                    break;
                }
                if(!Found) System.out.println("NO");
            }
        }
    }
    
}
