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.PrintWriter;
import java.util.Iterator;
import java.util.Scanner;
import java.util.TreeSet;

public class VKCUPA {

    static class Friend implements Comparable<Friend> {

        int val, num;

        public Friend(int val, int num) {
            this.num = num;
            this.val = val;
        }

        @Override
        public int hashCode() {
            int hash = 5;
            hash = 37 * hash + this.val;
            hash = 37 * hash + this.num;
            return hash;
        }

        @Override
        public boolean equals(Object obj) {
            if (obj == null) {
                return false;
            }
            if (getClass() != obj.getClass()) {
                return false;
            }
            final Friend other = (Friend) obj;
            if (this.val != other.val) {
                return false;
            }
            if (this.num != other.num) {
                return false;
            }
            return true;
        }

        @Override
        public int compareTo(Friend o) {
            return -Integer.compare(val, o.val);
        }

    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        int n = in.nextInt();
        int k = in.nextInt();
        int q = in.nextInt();
        Friend[] a = new Friend[n];
        for (int i = 0; i < n; i++) {
            int num = in.nextInt();
            a[i] = new Friend(num, i + 1);
        }
        TreeSet<Friend> set = new TreeSet<>();

        for (int i = 0; i < q; i++) {
            int o = in.nextInt();
            int fr = in.nextInt();
            fr--;
            if (o == 1) {
                set.add(a[fr]);
            } else {
                if (set.contains(a[fr])) {
                    out.println("YES");
                } else {
                    out.println("NO");
                }
            }
            if (set.size() > k) {
                int nn = 0;
                for (Friend j : set) {
                    if (nn >= k) {
                        set.remove(j);
                    }
                    nn++;
                }
            }
        }
        out.flush();
    }
}
