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


/**
 * Author :- Harsh Chaudhari 
 * College :- DAIICT
 */
import java.util.*;
import java.io.*;

public class B658 {

	public static void main(String[] args) {
		InputReader s = new InputReader(System.in);
		OutputStream outputStream = System.out;
		PrintWriter out = new PrintWriter(outputStream);
		//Main code starts from here
		int n=s.nextInt(),count=0,k=s.nextInt(),q=s.nextInt();
		int t[] =new int[n+1];
		int tempt[] =new int[n+1];
		int check[] = new int[n+1];
		int temp[] =new int[n+1];
		t[0]=0;tempt[0]=0;
		for(int a=1;a<=n;a++){tempt[a]=s.nextInt();
			t[a]=tempt[a];
		}
		Arrays.sort(t);
		String tmp1=" ",tmp=" ";
		for(int i=0;i<=n;i++){
			temp[i]=t[n-i];
			if(i<k)
				tmp1+=(t[n-i]+" ");}
		//System.out.println(tmp1);
		//System.out.println(Arrays.toString(t));
		for(int p=1;p<=n;p++){
			//System.out.println(tmp1);
			//System.out.println(t[p]);
			if(tmp1.contains(" "+tempt[p]+" ")){
				tmp+=(p+" ");
				//System.out.println(tmp);
			}
		}
		//System.out.println(tmp+" "+tmp1);
		while(q-->0){
			int type=s.nextInt(),id=s.nextInt();
			if(type==1){
				check[id]=1;count++;
				//System.out.println(Arrays.toString(check));
				if(count>k){
					for(int i=1;i<n+1;i++){
						if((check[i]==1 && !tmp.contains(" "+i+" "))){
							check[i]=0;count--;
						}
					}
					//System.out.println(count+" "+k);
					if(count<k){
						for(int i=k;i<=n;i++){
							for(int j=1;j<=n;j++){
								//System.out.println(j+" "+id+" "+check[j]+" "+temp[i]+" "+tempt[j]);
								if((j==id && check[j]==0) && (temp[i]==tempt[j])){
									//System.out.println(j+" "+id+" "+check[j]+" "+temp[i]+" "+tempt[j]);
									check[j]=1;
									count++;
								}
								if(count==k)
									break;
							}
							//System.out.println(count+" "+k);
							if(count==k)
								break;
						}
					}
				}
			}
			else{
				if(check[id]==1)
					out.println("YES");
				else
					out.println("NO");
			}
		}
		//Ends here
		out.close();
	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream inputstream) {
			reader = new BufferedReader(new InputStreamReader(inputstream));
			tokenizer = null;
		}

		public String nextLine() {
			String fullLine = null;
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					fullLine = reader.readLine();
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				return fullLine;
			}
			return fullLine;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

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

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

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