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.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;


public class bearanddisplayedfriends {

    public static void main(String[] args) throws Exception {
        BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter w = new PrintWriter(System.out);

        StringTokenizer st = new StringTokenizer(r.readLine());
        int n = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());
        int q = Integer.parseInt(st.nextToken());
        
        int[] relationValues = new int[n];
        st = new StringTokenizer(r.readLine());
        for (int i = 0; i < n; i++) relationValues[i] = Integer.parseInt(st.nextToken());
        
        ArrayList<Integer> friends = new ArrayList<Integer>();
        for (int i = 0; i < q; i++) {
            st = new StringTokenizer(r.readLine());
            int one = Integer.parseInt(st.nextToken());
            
            if (one == 1) {
                //add to friend list
                
                int value = relationValues[Integer.parseInt(st.nextToken()) - 1];
                if (friends.size() < k)
                    friends.add(value);
                else {
                    //find the lowest one to remove
                    int lowest = 1000000000;
                    int index = -1;
                    for (int j = 0; j < friends.size(); j++) {
                        if (friends.get(j) < lowest) {
                            lowest = friends.get(j);
                            index = j;
                        }
                    }
                    
                    if (lowest < value) {
                        friends.set(index, value);
                    }
                }
            } else {
                int friend = Integer.parseInt(st.nextToken());
                int value = relationValues[friend - 1];
                
                boolean found = false;
                for (int j = 0; j < friends.size(); j++) {
                    if (friends.get(j) == value) {
                        w.println("YES");
                        found = true;
                        break;
                    }
                }
                
                if (!found) w.println("NO");
            }
        }
        
        w.flush();
    }

}
