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.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;

/**
 * Created by yujiahao on 3/28/16.
 */
public class vk_1_b {
    private FastScanner in;
    private PrintWriter out;

    public void solve() throws IOException {
        int n = in.nextInt();
        int k = in.nextInt();
        int q = in.nextInt();

        int[] val = new int[n];
        for (int i=0; i<n; i++){
            val[i] = in.nextInt();
        }


        PriorityQueue<person> queue = new PriorityQueue<person>(k, new Comparator<person>(){
           public int compare(person a, person b){
               return a.value -b.value;
           }
        });

        HashSet<Integer> set = new HashSet<Integer>();

        for (int i=0; i<q; i++){
            int type = in.nextInt();
            int id   = in.nextInt()-1;

            if (type==2){
                if (set.contains(id)){
                    out.println("YES");
                }else{
                    out.println("NO");
                }
            }else{
                if (queue.size()<k){
                    person cur = new person(val[id], id);
                    queue.offer(cur);
                    set.add(id);
                }else{
                    if (val[id]<queue.peek().value) continue;
                    int toRemoveId = queue.poll().id;
                    set.remove(toRemoveId);

                    person cur = new person(val[id], id);
                    queue.offer(cur);
                    set.add(id);
                }
            }
        }
    }


    public void run() {
        try {
            in = new FastScanner();
            out = new PrintWriter(System.out);
            solve();
            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private class FastScanner {
        private BufferedReader br;
        private StringTokenizer st;

        public FastScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

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

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

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

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public BigInteger nextBigInteger() { return new BigInteger(next());}

    }

    public static void main(String[] arg) {
        new vk_1_b().run();
    }
}

class person{
    int value;
    int id;

    public person(int value, int id){
        this.value = value;
        this.id = id;
    }
}
