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.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
 
import java.util.*;
public class Main {
	int N,K,Q;
	int[] t;
	
	private class P implements Comparable<P>{
		int f,s;
		public P(int f,int s){
			this.f = f;
			this.s = s;
		}
		
		public int compareTo(P p){
			return this.f - p.f;
		}
	}
	
	public void solve() {
		N = nextInt();
		K = nextInt();
		Q = nextInt();
		t = new int[N];
		for(int i = 0;i < N;i++){
			t[i] = nextInt();
		}
		
		PriorityQueue<P> pq = new PriorityQueue<P>();
		for(int i = 0;i < Q;i++){
			int type = nextInt();
			int id = nextInt();
			if(type == 1){
				pq.add(new P(-t[id - 1],id));
			}else{
				Queue<P> q = new ArrayDeque<P>();
				int len = Math.min(K,pq.size());
				boolean find = false;
				for(int j = 0;j < len;j++){
					P p = pq.poll();
					if(p.s == id)find = true;
					q.add(p);
				}
				pq.addAll(q);
				out.println(find ?"YES" : "NO"); 
			}
		}
	}
 
	public static void main(String[] args) {
		out.flush();
		new Main().solve();
		out.close();
	}
 
	/* Input */
	private static final InputStream in = System.in;
	private static final PrintWriter out = new PrintWriter(System.out);
	private final byte[] buffer = new byte[2048];
	private int p = 0;
	private int buflen = 0;
 
	private boolean hasNextByte() {
		if (p < buflen)
			return true;
		p = 0;
		try {
			buflen = in.read(buffer);
		} catch (IOException e) {
			e.printStackTrace();
		}
		if (buflen <= 0)
			return false;
		return true;
	}
 
	public boolean hasNext() {
		while (hasNextByte() && !isPrint(buffer[p])) {
			p++;
		}
		return hasNextByte();
	}
 
	private boolean isPrint(int ch) {
		if (ch >= '!' && ch <= '~')
			return true;
		return false;
	}
 
	private int nextByte() {
		if (!hasNextByte())
			return -1;
		return buffer[p++];
	}
 
	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = -1;
		while (isPrint((b = nextByte()))) {
			sb.appendCodePoint(b);
		}
		return sb.toString();
	}
 
	public int nextInt() {
		return Integer.parseInt(next());
	}
 
	public long nextLong() {
		return Long.parseLong(next());
	}
 
	public double nextDouble() {
		return Double.parseDouble(next());
	}
}