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.IOException;
import java.io.InputStreamReader;
import java.text.DecimalFormat;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.PriorityQueue;

public class Solution{

	public static void main(String[] args) throws NumberFormatException, IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] a = br.readLine().split(" ");
		int n = Integer.parseInt(a[0]);
		int k =Integer.parseInt(a[1]);
		int q =Integer.parseInt(a[2]);
		a = br.readLine().split(" ");
		int[] arr = new int[n];
		for(int i=0;i<n;i++){
			arr[i] = Integer.parseInt(a[i]);
		}

		PriorityQueue<Integer> pq = new PriorityQueue<Integer>();
		HashMap<Integer  , Integer> map = new HashMap<Integer,Integer>();
		for(int i=0;i<q;i++){
			a = br.readLine().split(" ");
			int type = Integer.parseInt(a[0]);
			int id =Integer.parseInt(a[1]);
			if(type == 1){
				if(pq.size() < k){
					pq.add(arr[id-1]);
					map.put(arr[id-1],id);
				}else{ 

					int pp = pq.peek();
					if(pp < arr[id-1]){
						pq.remove();
						map.remove(pp);
						map.put(arr[id-1],id);
						pq.add(arr[id-1]);
					}
				}
			}
			else{
				if(map.containsKey(arr[id-1]))
					System.out.println("YES");
				else System.out.println("NO");
			}

		}

	}

}

