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 B658
{

	/*private class Pairz implements Comparable<Pairz>{
    {
		public int index;
		public int t;

		public Pairz(int aindex, int at)
		{
			index = aindex;
			t = at;
		}

		@Override
	    public int compareTo(Pairz other){
	        // compareTo should return < 0 if this is supposed to be
	        // less than other, > 0 if this is supposed to be greater than 
	        // other and 0 if they are supposed to be equal
	        int last = (other.t > t) ? -1 : 1;
	        return (other.t == t) ? 0 : last;
	    }
	}*/

	public static void main(String[] args) throws Exception
	{
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int k = in.nextInt();
		int q = in.nextInt();
		int[] t = new int[n+1];

		int[] online = new int[k];

		for (int i = 1; i <= n; i++) {
			t[i] = in.nextInt();
		}

		for (int i = 0; i < k; i++) {
			online[i] = Integer.MIN_VALUE;
		}

		for (int i = 0; i < q; i++) {

			int type = in.nextInt();
			int id = in.nextInt();

			if (type == 1) {
				if (t[id] > online[0]) {
					online[0] = t[id];
					Arrays.sort(online);
				}
			}
			else {
				boolean found = false;
				for (int j = 0; j < k; j++) {
					if (online[j] == t[id]) {
						System.out.println("YES");
						found = true;
					}
				}
				if (!found) {
					System.out.println("NO");
				}
			}
		}
	}
}