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.*;
import java.io.*;
public class A639 {
public static void main(String[] args) throws IOException {
	FS input = new FS(System.in);
	PrintWriter out = new PrintWriter(System.out);
	int n = input.nextInt(), k = input.nextInt(), q = input.nextInt();
	int[] ts = new int[n];
	for(int i = 0; i<n; i++) ts[i] = input.nextInt();
	PriorityQueue<Friend> online = new PriorityQueue<Friend>();
	for(int qq = 0; qq<q; qq++)
	{
		int type = input.nextInt();
		if(type == 1)
		{
			int id = input.nextInt();
			//out.println(id);
			online.add(new Friend(id, ts[id-1]));
			if(online.size() > k) online.poll();
		}
		else
		{
			int id = input.nextInt();
			boolean f = false;
			for(Friend x : online) if(x.i == id) f = true;
			out.println(f ? "YES": "NO");
		}
	}
	out.close();
}
static class Friend implements Comparable<Friend>
{
	int i, t;
	public Friend(int ii, int tt)
	{
		i = ii; t = tt;
	}
	@Override
	public int compareTo(Friend o) {
		// TODO Auto-generated method stub
		return t - o.t;
	}
}
static class FS {
	BufferedReader br;
	StringTokenizer st;

	FS(InputStream in) {
		br = new BufferedReader(new InputStreamReader(in));
	}

	String next() throws IOException {
		while (st == null || !st.hasMoreTokens())
			st = new StringTokenizer(br.readLine());
		return st.nextToken();
	}

	int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	long nextLong() throws IOException {
		return Long.parseLong(next());
	}

	double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}
}
}
