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.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.*;

public class Main
{

	public static void main(String []args)
	throws IOException
	{

		BufferedReader reader = new BufferedReader(
			new InputStreamReader(System.in));

		String []arr = reader.readLine().split(" ");
		int n = Integer.parseInt(arr[0]);
		int k = Integer.parseInt(arr[1]);
		int q = Integer.parseInt(arr[2]);

		arr = reader.readLine().split(" ");

		int []ids = new int[n + 1];
		for (int i=0;i < n;++i)
		{
			ids[i + 1] = Integer.parseInt(arr[i]);
		}


		StringBuilder ans = new StringBuilder();

		int count = 0;
		PriorityQueue<Pair> pq = new PriorityQueue<Pair>();
		boolean []flag = new boolean[n + 1];

		for (int i=1;i <= q;++i)
		{
			arr = reader.readLine().split(" ");
			int type = Integer.parseInt(arr[0]);
			int id = Integer.parseInt(arr[1]);

			if (type == 1)
			{
				pq.add(new Pair(ids[id],id));
				++count;
				flag[id] = true;

				if (count > k)
				{
					--count;
					flag[pq.poll().id] = false;
				}


			}
			else
			{
				if (flag[id])
					ans.append("YES");
				else
					ans.append("NO");
				ans.append("\n");
			}



		}

		System.out.println(ans.toString());

	}

}

class Pair implements Comparable<Pair>
{

	int val,id;

	public Pair(int val, int id)
	{
		this.val = val;
		this.id = id;
	}

	@Override
	public int compareTo(Pair p1)
	{
		// TODO: Implement this method
		return this.val - p1.val;
	}


}





	






