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 shambala on 28/03/16.
 */

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

public class TaskA {

    FastScanner in;
    PrintWriter out;

    public void solve() throws IOException {
        int n = in.nextInt();
        int k = in.nextInt();
        int q = in.nextInt();
        int[] d = new int[n];
        for (int i = 0; i<n ; i++) {
            d[i] = in.nextInt();
        }
        ArrayList<Integer> lst = new ArrayList<>();
        for (int i = 0; i<q; i++) {
            int t = in.nextInt();
            int nm = in.nextInt();
            if (t==1) {
                if (lst.size()<k) {
                    lst.add(nm);
                } else {
                    int min = Integer.MAX_VALUE;
                    int minpos = 0;
                    for (int j = 0; j<lst.size(); j++) {
                        if (d[lst.get(j)-1] < min) {
                            min = d[lst.get(j)-1];
                            minpos = j;
                        }
                    }
                    if (d[nm-1]>min) {
                        lst.remove(minpos);
                        lst.add(nm);
                    }
                }
            } else {
                if (lst.contains(nm)) {
                    System.out.println("YES");
                } else System.out.println("NO");
            }
        }
    }

    public void run() {
        try {
            in = new FastScanner();
            //out = new PrintWriter(new File(".out"));

            solve();

            //out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

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

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

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

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