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

//package CodeForces.VkCup2016R1;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Comparator;
import java.util.HashMap;
import java.util.StringTokenizer;
import java.util.TreeSet;

/**
 * Created by ilya on 28.03.16.
 */

public class A639 {
    public static void main(String[] args) {
        sc sc = new sc();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        TreeSet<friend> friends = new TreeSet<>();
        int n = sc.nextInt(), k = sc.nextInt(), q = sc.nextInt();
        int[] fm = new int[n+1];
        for (int i = 0; i < n; i++) {
            fm[i+1] = sc.nextInt();
        }
        for (int i = 0; i < q; i++) {
            int a = sc.nextInt();
            int id = sc.nextInt();
            if (a == 1) {
                if (friends.size() < k) {
                    friends.add(new friend(id, fm[id]));
                }
                else {
                    friends.remove(friends.last());
                    friends.add(new friend(id, fm[id]));
                }
            } else {
                if (friends.contains(new friend(id, fm[id]))) out.println("YES");
                else out.println("NO");
            }
        }
        out.close();
    }
    static class friend implements Comparable<friend>{
        int i;
        int t;

        public friend(int i, int t) {
            this.i = i;
            this.t = t;
        }

        @Override
        public int compareTo(friend o) {
            return Integer.compare(o.t, this.t);
        }

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

            friend friend = (friend) o;

            if (i != friend.i) return false;
            return t == friend.t;

        }

        @Override
        public int hashCode() {
            int result = i;
            result = 31 * result + t;
            return result;
        }
    }

    public static class sc {
        BufferedReader br;
        StringTokenizer st;

        public sc() {
            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();
        }

        Integer 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;
        }
    }

}

