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

// @author:debverine | 28-Mar-2016 | 11:37:03 pm
import java.io.*;
import java.util.*;

public class Bear_Displayed_Friends {

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		int n,k,q,ch,id,i;
		long arr[];
		String inp[],inpa[];
		boolean flag;
		inp=br.readLine().split(" ");
		n=Integer.parseInt(inp[0]);
		k=Integer.parseInt(inp[1]);
		q=Integer.parseInt(inp[2]);
		arr=new long[k];
		inpa=br.readLine().split(" ");
		Arrays.fill(arr, -1);
		while ( q-- > 0 ) {
			inp=br.readLine().split(" ");
			ch=Integer.parseInt(inp[0]);
			id=Integer.parseInt(inp[1]);
			if(ch==1){
				if(arr[0]<Integer.parseInt(inpa[id-1]))
					arr[0]=Integer.parseInt(inpa[id-1]);
				Arrays.sort(arr);
			}
			else{
				id=Integer.parseInt(inpa[id-1]);
				flag = false;
				for(i=0;i<k;i++){
					if(arr[i]==id)
						flag=true;
				}
				if(flag)
					pw.println("YES");
				else
					pw.println("NO");
			}	
		}
		pw.flush();
		pw.close();

	}

}
