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.*;
import java.nio.file.*;
import java.io.*;
import java.lang.*;
import java.math.*;

public class VK_CUP_OTB_A {

	public static void main(String[] args) {
		new VK_CUP_OTB_A().Run();
	}
	
	Scanner in;
	PrintWriter out;
	
	VK_CUP_OTB_A() {
		in = new Scanner(System.in);
		out = new PrintWriter(System.out);
	}
	
	public void Run(){
		Solve();
		out.close();
	}
	
	void Solve(){
		int n = in.nextInt();
		int k = in.nextInt();
		int[] otobr = new int[Math.min(6, k)];
		int q = in.nextInt(); 
		int[] T = new int[n]; 
		for(int i = 0; i < n; i++){
			T[i] = in.nextInt(); 
		}
		for(int i = 0; i < q; i++){
			int[] input = new int[] { in.nextInt(), in.nextInt() };
			
			if(input[0] == 1) { 
				int ind = -1; 
				int cntInd = -1; 
				int min = 0;
				for(int elemTable : otobr){
					cntInd++; 
					if(elemTable == 0  || ind == -1 || T[elemTable - 1] < T[min - 1]) { 
						min = elemTable;
						ind = cntInd;
					}
				}
				int cntI = 0;
				boolean flag = false; 
				for(int g : otobr){ 
					if(g == 0) {
						otobr[cntI] = input[1];
						flag = true;
						break;
					} else cntI++;
				}
				if(!flag && T[input[1] - 1] > T[min - 1]){ 
					otobr[ind] = input[1];
				}
			}
			else if(input[0] == 2) { 
				boolean thatYes = false; 
				for(int g : otobr){ 
					if(g == input[1]) { 
						thatYes = true;
						break;
					}
				}
				
				if(thatYes) out.print("YES\n");
				else out.print("NO\n");
			}
		}
	}
}