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 final class BearFriends
{
	public static void main(String[] args) {
		Scanner br=new 
		Scanner(System.in);
		int n=br.nextInt();
		int k=br.nextInt();
		int q=br.nextInt();
		int c=0;
		int[] a=new int[n+1];
		for(int i=0;i<n;i++)
			a[i+1]=br.nextInt();
		Buddy[] arr=new Buddy[7];
		for(int i=0;i<q;i++)
		{
			int type=br.nextInt();
			int id=br.nextInt();
			if(type==1)
			{
				if(c==k)
				{	arr[k]=new Buddy(id,a[id]);
					Arrays.sort(arr,0,k+1);
				}
				else
				{
					arr[c]=new Buddy(id,a[id]);
					c++;
				}

			}
			else
			{
				boolean flag=false;
				for(int j=0;j<c;j++)
				{
					if(arr[j].id==id)
					{	System.out.println("YES");
						flag=true;
					}
				}
				if(!flag)
					System.out.println("NO");
			}
		}
	}
}
class Buddy implements Comparable<Buddy>
{
	int id,f;
	public Buddy(int id,int f)
	{
		this.id=id;
		this.f=f;
	}
	public int compareTo(Buddy that)
	{
	return that.f-this.f;
	}
}