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 ProB {
	static int n,k,q,ans,a,b;
	static Pair p;
	static int[] aa=new int[150005];
	static int[] mm=new int[150005];
	static Queue<Pair> qq=new PriorityQueue<Pair>();
	static class Pair implements Comparable<Pair>
	{
		int x,y;
		Pair(int a,int b)
		{
			x=a;y=b;
		}
		public int compareTo(Pair p) {
			return x-p.x;
		}
	}

	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		n=in.nextInt();k=in.nextInt();
		q=in.nextInt();
		for(int i=1;i<=n;i++)
			aa[i]=in.nextInt();
		while(q-->0)
		{
			a=in.nextInt();b=in.nextInt();
			if(a==1)
			{
				qq.add(new Pair(aa[b],b));
				mm[b]=1;
				if(qq.size()>k)
				{
					p=qq.poll();
					mm[p.y]=0;
				}
			}
			else
				System.out.println(mm[b]==1?"YES":"NO");
		}
	}
}
