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

#include <iostream>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <hash_set>
#include <list>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#include <cctype>
#include <cstring>
#include <numeric>
#include <functional>
#include <utility>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    int n = 0;
    int k = 0;
    int q = 0;
    cin >> n >> k >> q;
    auto rate = new unsigned long[n];
    for (int i = 0; i < n; i++) {
        cin >> rate[i];
    }
    auto window = new unsigned long[k];
    for (auto i = 0; i < k; i++) {
        window[i] = 0;
    }

    int query = 0;
    int id = 0;
    for (auto i = 0; i < q; i++) {
//        for (auto j = 0; j < k; j++) {
//            cout << window[j];
//        }
        cin >> query >> id;
        if (query == 1) {
            for (auto j = 0; j < k; j++) {
                if (rate[id] < rate[window[j]] || window[j] == 0) {
                    for (auto h = j; h < k; h++) {
                        window[j+1] = window[j];
                    }
                    window[j] = id;
                    break;
                }
            }
        } else if (query == 2) {
            bool found = false;
            for (auto j = 0; j < k; j++) {
                if (window[j] == id) {
                    found = true;
                    break;
                }
            }
            if (found == true) {
                cout << "YES" << endl;
            } else {
                cout << "NO" << endl;
            }
        }
    }

    return 0;
}



