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.PriorityQueue;
import java.util.Scanner;

public class Main{

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		PriorityQueue<Integer> minheap = new PriorityQueue<Integer>();
		int n = in.nextInt();
		int k = in.nextInt();
		int q = in.nextInt();
		int[] friendship = new int[n];
		for(int x=0; x<n;x++)
		{
			friendship[x]= in.nextInt();
		}
		for(int x=0;x<q;x++)
		{
			int type = in.nextInt();
			int id = in.nextInt();
			int temp = friendship[id-1];
			if(type == 1)
			{
				if(minheap.size()<k)
				{
					minheap.add(temp);
				}
				else if(!minheap.isEmpty()&&minheap.peek()<temp)
				{
					minheap.remove();
					minheap.add(temp);
				}
			}
			else
			{
				if(minheap.contains(temp))
					System.out.println("YES");
				else
					System.out.println("NO");
			}
		}
	}

}
