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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
import java.util.TreeSet;

/*07:05:45PM

 String x =sc.next();
 char inp [] = x.toCharArray();
 SimpleDateFormat displayFormat = new SimpleDateFormat("HH:mm");
 SimpleDateFormat parseFormat = new SimpleDateFormat("hh:mm a");
 Date date = parseFormat.parse(x.substring(0, 5)+" "+x.substring(8, 10));
 System.out.println(displayFormat.format(date)+":"+x.substring(6, 8));
 */

public class Main {
	
	
	public static void main(String[] args) throws Exception
	{
		Scanner sc= new Scanner(System.in);
		int n  = sc.nextInt() , k =sc.nextInt() , q=sc.nextInt();
		long t [] = new long[n];
		for(int i =0 ; i < n ; i++)
			t[i]=sc.nextLong();
		ArrayList<Integer> arr = new ArrayList<Integer>();
		while(q-->0)
		{
			int a = sc.nextInt() ;int b = sc.nextInt();
			if(a==1)
			{
				if(arr.size()==0)
					arr.add(b);
				else {
					int mnIndex =0 ;long mnNumber =Long.MAX_VALUE;int mnId=0;
					for(int i =0 ; i < Math.min(6, n) && i <arr.size();i++)
						if(t[(arr.get(i)-1)]<mnNumber)
						{
							mnNumber = t[(int)(arr.get(i)-1)];
							mnIndex=i;
							mnId =arr.get(i);
						}
					if(t[(b-1)]>mnNumber){
						arr.remove(mnIndex);
						arr.add((b));
						if(arr.size()<k)arr.add(mnId);
					}
					else 
					{
						if(arr.size()<k)arr.add((b));
					}
				}
			}
			else 
			{
				boolean found =false;
				for(int i =0 ; i < Math.min(6, n) && i <arr.size();i++)
					if(arr.get(i)==b){
						System.out.println("YES");found = true;
					}
				if(!found)System.out.println("NO");
			}
		}
	}
}

class Pair {
	public int x, y;

	Pair(int a, int b) {
		x = a;
		y = b;
	}
}
class Triple implements Comparable<Triple>{
	public int x, y,z;

	Triple(int a, int b, int c) {
		x = a;
		y = b;
		z=c;
	}

	@Override
	public int compareTo(Triple o) {
		// TODO Auto-generated method stub
		return (o.x==x && o.y ==y && o.z==z)?0:-1;
	}
	
}

class Scanner {
	StringTokenizer st;
	BufferedReader br;

	public Scanner(InputStream s) {
		br = new BufferedReader(new InputStreamReader(s));
	}

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

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

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

	public String nextLine() throws IOException {
		return br.readLine();
	}

	public double nextDouble() throws IOException {
		String x = next();
		StringBuilder sb = new StringBuilder("0");
		double res = 0, f = 1;
		boolean dec = false, neg = false;
		int start = 0;
		if (x.charAt(0) == '-') {
			neg = true;
			start++;
		}
		for (int i = start; i < x.length(); i++)
			if (x.charAt(i) == '.') {
				res = Long.parseLong(sb.toString());
				sb = new StringBuilder("0");
				dec = true;
			} else {
				sb.append(x.charAt(i));
				if (dec)
					f *= 10;
			}
		res += Long.parseLong(sb.toString()) / f;
		return res * (neg ? -1 : 1);
	}

	public boolean ready() throws IOException {
		return br.ready();
	}

}
