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.ArrayList;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Scanner;

public class B {
	
	

	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int k = in.nextInt();
		int q = in.nextInt();
		
		ArrayList<Friend> f = new ArrayList<>();
		
		for(int i= 0;i<n;i++){
			int score = in.nextInt();
			f.add(new Friend(i,score));
		}
		
		PriorityQueue<Friend> pq = new PriorityQueue<>();
		HashSet<Friend> cur = new HashSet<>();
		
		
		for(int i =0;i<q;i++){
			int typ = in.nextInt();
			int id = in.nextInt()-1;
			Friend on = f.get(id);
			if(typ==1){
				pq.add(on);
				
				
				while(pq.size() > k){
					Friend top = pq.remove();		
				}
			}
			else{
				System.out.println(pq.contains(on)?"YES":"NO");
			}
		}
	}
}
class Friend implements Comparable<Friend>{
		int id, score;
		
		Friend(int i, int s){
			id = i;
			score = s;
		}
		
		public int compareTo(Friend f){
			return score - f.score;
		}
	}
