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.*;

public class Main
{
	
	public static void main(String[] args)
	{
		Scanner in=new Scanner(System.in);
		int n=in.nextInt();
		int k=in.nextInt();
		int q=in.nextInt();
		int[] rel=new int[n];
		for (int i=0; i<n;i++){
			rel[i]=in.nextInt();
		}
		MyWindow win=new MyWindow(k, rel);
		for (int i=0;i<q;i++){
			int type=in.nextInt();
			int id=in.nextInt();
			if (type==1){
				win.add(id);
			}
			else {
				System.out.println(win.contains(id)?"YES":"NO");
			}
		}
	}
}

class MyWindow{
	private int[] ratings;
	private int[] win;
	private int winsize;

	MyWindow(int size, int[] rat){
		ratings=rat;
		win=new int[size];
		winsize=size;
	}

	void add(int id){
		if (comp(win[winsize-1],id)){
			int i;
			for(i=winsize-2;i>=0;i--){
				if(comp(win[i],id)){
					win[i+1]=win[i];
				}
				else {
					win[i+1]=id;
					break;
				}
			}
			if (i==-1) win[0]=id;
		}
	}

	private boolean comp(int id1, int id2){
		return id1==0 || ratings[id1-1]<ratings[id2-1];
	}

	boolean contains(int id){
		for (int i:win)
			if (i==id) return true;
		return false;
	}
}