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

public class VK2016R1B {

	static BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
	static PrintWriter out = new PrintWriter(System.out);
	static StringTokenizer tokens;
	
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		
		int n = scan.nextInt();
		int k = scan.nextInt();
		int q = scan.nextInt();
		
		PriorityQueue pq = new PriorityQueue();
		ArrayList<Friend> friendList = new ArrayList<Friend>();
		for (int i=0; i<n; i++) {
			friendList.add(new Friend(scan.nextInt(), i+1));
		}
		
		for (int i = 0; i<q; i++) {
			int t = scan.nextInt();
			int id = scan.nextInt();
			if (t == 1) {
				pq.add(friendList.get(id-1));
				while (pq.size() >k) {
					pq.poll();
				}
			} else {
				if (pq.contains(friendList.get(id-1))){
					System.out.println("YES");
				} else {
					System.out.println("NO");
				}
			}
		}
		
		out.flush();
		out.close();
	}

}

class Friend implements Comparable<Friend> {

	int friendship;
	int id;
	boolean online;
	
	public Friend(int f, int i) {
		friendship = f;
		id = i;
		online = false;
	}
	
	@Override
	public int compareTo(Friend arg0) {
		// TODO Auto-generated method stub
		return friendship - arg0.friendship;
	}
	
	public boolean equals(Friend o) {
		return (o.id == this.id);
		
	}
	
}