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

public class SolveA {
	BufferedReader br;
	StringTokenizer in;
	PrintWriter out;

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

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

	public double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
	
	public long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	public static void main(String[] args) throws IOException {
		new SolveA().run();
	}
	class Pair implements Comparable<Pair>{
		int v;
		int id;
		@Override
		public int compareTo(Pair that) {
			if (this.v == that.v) {
				return this.id - that.id;
			}
			return that.v - this.v;
		}
		public Pair(int v, int id) {
			super();
			this.v = v;
			this.id = id;
		}
		
	}
	public void solve() throws IOException {
		int n = nextInt();
		int k = nextInt();
		int q = nextInt();
		int[] t = new int[n];
		for (int i = 0; i < n; i++) {
			t[i] = nextInt();
		}
		TreeSet<Pair> set = new TreeSet<>();
		while (q-- > 0) {
			int type = nextInt();
			int id = nextInt();
			if (type == 1) {
				if (set.size() < k) {
					set.add(new Pair(t[id - 1], id));
				} else {
					Pair cur = new Pair(t[id - 1], id);
					Pair last = set.last();
					if (cur.compareTo(last) < 0) {
						set.remove(last);
						set.add(cur);
					}
				}
			} else {
				//check
				out.println(set.contains(new Pair(t[id - 1], id)) ? "YES" : "NO");
			}
		}
	}

	public void run() {
		try {
			br = new BufferedReader(new InputStreamReader(System.in)); // new
																		// InputStreamReader(System.in)
			out = new PrintWriter(System.out); // System.out

			solve();

			out.close();
		} catch (IOException e) {
			e.printStackTrace();
			System.exit(1);
		}
	}
}
