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 Code {
	
	static class friend{
		private Integer id;
		private Integer rel;
		
		public friend(Integer x, Integer y){
			id=x;
			rel=y;
		}
	}
	
	static class PQsort implements Comparator<friend>{
		@Override
		public int compare(friend one , friend two){
			return (int)(two.rel - one.rel);
		}
	}
	
	static Comparator<friend> pqs = new PQsort();
	
	public static void main(String[] args) throws Exception{
		// TODO Auto-generated method stub
		Scanner data = new Scanner(System.in);
		Integer n = data.nextInt();
		Integer k = data.nextInt();
		Integer q = data.nextInt();
		Integer f[]= new Integer[n];
		for (Integer i=0;i<n;i++){
			f[i]=data.nextInt();
		}
		ArrayList<friend> a = new ArrayList<friend>();
		StringBuilder sb = new StringBuilder();
		Integer count=0,flag=0;
		for (Integer i=0;i<q;i++){
			System.out.println(a.size());
			if (data.nextInt() == 1){
				Integer id = data.nextInt();
				if (a.size()<k){
					friend t = new friend(id,f[id-1]);
					a.add(t);
					count++;
					Collections.sort(a,pqs);
				}
				else{
					if (a.get(Math.max(k-1, count-1)).rel<f[id-1]){
						friend t = new friend(id,f[id-1]);
						a.remove(Math.max(k-1, count-1));
						a.add(t);
						Collections.sort(a,pqs);
					}
				}
			}
			else{
				flag=0;
				Integer id = data.nextInt();
				for (friend j:a){
					if (j.id == id){
						sb.append("YES\n");
						flag=1;
						break;
					}
				}
				if (flag==0){
					sb.append("NO\n");
				}
			}
		}
		data.close();
	System.out.println(sb);
	}
}	



