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.*;
  
public class Main {
	
    static class FastScanner
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastScanner() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    } 
  
    public static void main(String[] args) throws IOException {
        FastScanner sc=new FastScanner();
        int N = sc.nextInt();
        int K = sc.nextInt();
        int Q = sc.nextInt();
        int[][] friends = new int[N+1][2];
        for (int i = 1; i <= N; i++) {
        	friends[i][0] = i;
        	friends[i][1] = sc.nextInt();
        }
        PriorityQueue<int[]> pq = new PriorityQueue<int[]>(new Comparator<int[]>(){
            public int compare(int[] a, int[] b) {
              return a[1] - b[1];
            }
        });
        HashSet<Integer> online = new HashSet<Integer>();
        for (int q = 0; q < Q; q++) {
        	int type = sc.nextInt();
        	int id = sc.nextInt();
        	if (type == 1) {
        		if (online.size() < K) {
        			online.add(id);
        			pq.add(friends[id]);
        		} else {
        			int[] minFriend = pq.peek();
        			if (minFriend[1] < friends[id][1]) {
        				online.remove(minFriend[0]);
        				online.add(id);
        				//remove minFriend, add friends[id];
        				pq.poll();
        				pq.add(friends[id]);
        			}
        		}
        	} else {
        		if (online.contains(id)) {
        			System.out.println("YES");
        		} else {
        			System.out.println("NO");
        		}
        	}
        }
    }
}