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.StreamTokenizer;
import java.util.Iterator;
import java.util.PriorityQueue;

public class Main {

	private static StreamTokenizer inputReader = new StreamTokenizer(
			new BufferedReader(new InputStreamReader(System.in)));
	
	public static int nextInt() {
		int a = -1;
		try {
			inputReader.nextToken();
			a = (int) inputReader.nval;
		} catch (Exception e) {
		}
		return a;
	}
	
	public static void main(String[] args) {
		int numberOFFriends = nextInt();
		int screenSize = nextInt();
		int numberOfQueries = nextInt();
		
		
		int[] friendshipVaue = new int[numberOFFriends];
		for (int i = 0; i < numberOFFriends; i++) {
			friendshipVaue[i] = nextInt();
		}
		
		StringBuilder builder = new StringBuilder();
		PriorityQueue<Integer> queue = new PriorityQueue<>();

		int min = Integer.MAX_VALUE;
		for (int i = 0; i < numberOfQueries; i++) {
			int x = nextInt();
			int y = nextInt();
			
			if (x == 2) {
				if (queue.contains(friendshipVaue[y - 1])) {
					builder.append("YES" + "\n");
				} else {
					builder.append("NO" + "\n");
				}
			}
			
			if (x == 1) {
				if (queue.size() < screenSize) {
					queue.add(friendshipVaue[y - 1]);
					
					if (friendshipVaue[y - 1] < min) {
						min = friendshipVaue[y - 1];
					}
					
				} else if (friendshipVaue[y - 1] > min){
					queue.poll();
					queue.add(friendshipVaue[y - 1]);
					
					for (Integer value : queue) {
						if (value < min) {
							min = value;
						}
					}
				}
			}
		}
		
		System.out.println(builder);
	}

}
