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.HashMap;
import java.util.Scanner;
import java.util.TreeSet;


public class ProblemB {
	public static void main(String[] args){
		Scanner input = new Scanner(System.in);
		int n = input.nextInt(); //friends
		int k = input.nextInt(); //online friends
		int q = input.nextInt(); //queries
		int[] friendStrengths = new int[n];
		HashMap<Integer, Integer> inverseMap = new HashMap<Integer, Integer>();
		for(int a = 0; a < n; a++){
			friendStrengths[a] = input.nextInt();
			inverseMap.put(friendStrengths[a], a);
		}
		TreeSet<Integer> friendsList = new TreeSet<Integer>();
		for(int a = 0; a < q; a++){
			int q2 = input.nextInt();
			int id = input.nextInt()-1;
			if(q2 == 1){
				//add friend
				friendsList.add(friendStrengths[id]);
				if(friendsList.size() > k){
					friendsList.pollFirst();
				}
			}
			if(q2 == 2){
				if(friendsList.contains(friendStrengths[id])){
					System.out.println("YES");
				}
				else{
					System.out.println("NO");
				}
			}
		}
		
		
	}
}
