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.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;


public class BClass {
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int k = sc.nextInt();
		int q = sc.nextInt();
		final int[] friend = new int[n];
		int[] top = new int[k];
		
		for(int i=0;i<n;++i){
			friend[i] = sc.nextInt();
		}
		sc.nextLine();
		for(int i=0;i<q;++i){
			int t = sc.nextInt();
			int f = sc.nextInt();
			if(t == 1){
				if(top[0] == 0 || friend[top[0]-1] < friend[f-1]){
					top[0] = f;
				}
				int index = 0;
				while(index < k-1 && (top[index+1] == 0 || friend[top[index]-1]>friend[top[index+1]-1])){
					int temp = top[index];
					top[index]=top[index+1];
					top[index+1]=temp;
					index++;
				}
			}
			else{
				boolean bad = true;
				for(int j=0;j<k && bad;++j){
					if(top[j] == f){
						bad = false;
					}
				}
				if(!bad){
					System.out.println("YES");
				}
				else{
					System.out.println("NO");
				}
			}
		}
	}
}
