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

/* Andy Rock
 * March 28, 2016
 * 
 * VK Cup 2016 - Round 1 (Div. 2 Edition): B
 */

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class B
{
	public static void main(String[] args) throws IOException
	{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(in.readLine());

		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		int q = Integer.parseInt(st.nextToken());

		st = new StringTokenizer(in.readLine());
		int[][] t = new int[n][2];
		for(int i=0;i<n;i++)
			t[i] = new int[]{Integer.parseInt(st.nextToken()),i};

		Arrays.sort(t, new Comparator<int[]>()
		{
			public int compare(int[] a, int[] b)
			{
				return b[0]-a[0];
			}
		});

		Map<Integer, Integer> map = new HashMap<Integer, Integer>();
		for(int i=0;i<n;i++)
			map.put(t[i][1], i);

		int[] bit = new int[n+1];
		boolean[] on = new boolean[n+1];
		while(q --> 0)
		{
			st = new StringTokenizer(in.readLine());
			int type = Integer.parseInt(st.nextToken());
			int val  = map.get(Integer.parseInt(st.nextToken())-1)+1;

			if(type == 1)
			{
				update(bit, val);
				on[val] = true;
			}
			else
			{
				if(on[val] && sum(bit, val) <= k)
					System.out.println("YES");
				else
					System.out.println("NO");
			}
		}
	}

	static void update(int[] bit, int pos)
	{
		for(;pos<bit.length;pos+=pos&-pos)
			bit[pos]++;
	}

	static int sum(int[] bit, int pos)
	{
		int ans = 0;
		for(;pos>0;pos-=pos&-pos)
			ans += bit[pos];

		return ans;
	}
}