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

public class B658 {

	public static BufferedReader read = null;
	public static PrintWriter out = null;
	public static StringTokenizer token = null;
	
	public static void insert(int in, int l, int[] ar)
	{
		int temp = ar[l];
		ar[l] = in;
		for(int i=l+1; i<ar.length; i++)
		{
			int ct = ar[i];
			ar[i] = temp;
			temp = ct;
		}
	}
	public static void solve()
	{
		int n = nint(), k = nint(), q = nint();
		int[] t = narr(n);
		int[][] cd = new int[2][k];
		for(int i=0; i<k; i++) 
		{
			cd[0][i] = -1;
			cd[1][i] = -1;
		}
		
		for(int i=0; i<q; i++)
		{
			int type = nint();
			int id = nint();
			if(type == 1)
			{
				int j = 0;
				while(j < k && cd[0][j] > t[id-1]) j++;
				if(j < k) 
				{
					insert(t[id-1], j, cd[0]);
					insert(id, j, cd[1]);
				}
			}
			else
			{
				boolean f = false;
				for(int j =0; j<k; j++)
				{
					if(cd[1][j] == id) f= true;
				}
				out.println(f?"YES":"NO");
			}
		}
	}
	
	public static void main(String[] args)
	{
		read = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		solve();
		out.flush();
		out.close();
		
	}
	
	// i/o functions
	public static String next() // returns the next string
	{
		while(token == null || !token.hasMoreTokens())
		{
			try {
				token = new StringTokenizer(read.readLine());
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}
		return token.nextToken();
	}
	
	public static int nint()
	{
		return Integer.parseInt(next());
	}
	public static long nlong()
	{
		return Long.parseLong(next());
	}
	public static double ndouble()
	{
		return Double.parseDouble(next());
	}
	public static int[] narr(int n)
	{
		int[] a = new int[n];
		for(int i=0; i<n; i++) a[i] = nint();
		return a;
	}
	
	public static long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i=0; i<n; i++) a[i] = nlong();
		return a;
	}
	
	
}

