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.*;
public class vkcup2 {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int numFriends = sc.nextInt();
		int maxDisplay = sc.nextInt();
		int numQueries = sc.nextInt();
		
		int[] friendshipArray = new int[numFriends+1];
		for (int i = 0; i < numFriends; i++){
			friendshipArray[i+1] = sc.nextInt();
		}
		//System.out.println(numQueries);
		TreeMap<Integer, Integer> friendsOnline= new TreeMap<Integer, Integer>();
		for (int i = 0; i < numQueries; i++){
			
			int queryType = sc.nextInt();
			int friendNum = sc.nextInt();
			//System.out.println(queryType);
			//System.out.println(friendNum);
			
			if (queryType == 1){
				if (friendsOnline.size() < maxDisplay){
					friendsOnline.put(friendshipArray[friendNum], friendNum);
				}
				//If display is at capacity
				else if (friendsOnline.size() == maxDisplay){
					int lowestScore = friendsOnline.firstKey();
					
					
					if (friendshipArray[friendNum] > lowestScore){
						friendsOnline.remove(friendsOnline.firstKey());
						friendsOnline.put(friendshipArray[friendNum], friendNum);
					}
				}
			}else if(queryType == 2){
				if (friendsOnline.containsKey(friendshipArray[friendNum])){
					System.out.println("YES");
				}else{
					System.out.println("NO");
				}
			}
		}
	}
}
