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

/**
 * Created by heat_wave on 12.01.15.
 */

import java.io.*;
import java.util.*;

public class A {
    Scanner in = new Scanner(System.in);

    public void solve() {
        int n = in.nextInt();
        int k = in.nextInt();
        int q = in.nextInt();
        HashMap<Integer, Integer> to = new HashMap<>();
        HashMap<Integer, Integer> from = new HashMap<>();

        for (int i = 0; i < n; i++) {
            int val = in.nextInt();
            int id = i + 1;
            to.put(val, id);
            from.put(id, val);
        }
        PriorityQueue<Integer> queue = new PriorityQueue<>(Comparator.reverseOrder());

        for (int i = 0; i < q; i++) {
            int type = in.nextInt();
            int id = in.nextInt();
            if (type == 1) {
                queue.add(from.get(id));
            } else {
                ArrayList<Integer> res = new ArrayList<>();
                boolean flag = false;
                for (int j = 0; j < Math.min(k, queue.size()); j++) {
                    int f = queue.poll();
                    if (to.get(f) == id) {
                        flag = true;
                    }
                    res.add(f);
                }
                queue.addAll(res);

                if (flag) {
                    System.out.println("YES");
                }
                else {
                    System.out.println("NO");
                }
            }
        }
    }

    private class Pair<S, T> {
        public S first;
        public T second;

        public Pair(S first, T second) {
            this.first = first;
            this.second = second;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;

            Pair<?, ?> pair = (Pair<?, ?>) o;

            if (!first.equals(pair.first)) return false;
            return second.equals(pair.second);

        }

        @Override
        public int hashCode() {
            int result = first.hashCode();
            result = 31 * result + second.hashCode();
            return result;
        }
    }

    private static long findGCD(long number1, long number2) {
        //base case
        if(number2 == 0){
            return number1;
        }
        return findGCD(number2, number1 % number2);
    }

    public void run() {
        solve();
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

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

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

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

    public static void main(String[] args) {
        new A().run();
    }
}