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 <bits/stdc++.h>
using namespace std;
int main() {
  int32_t n, k, q;
  cin >> n >> k >> q;
  vector<int64_t> friendship;
  vector<int64_t> online;
  vector<string> results;
  make_heap(online.begin(), online.end(), [&](int32_t x, int32_t y) {
    return friendship[x - 1] > friendship[y - 1];
  });
  for (int32_t i = 0; i < n; i++) {
    int64_t t;
    cin >> t;
    friendship.push_back(t);
  }
  for (int32_t i = 0; i < q; i++) {
    int16_t type;
    int32_t id;
    cin >> type >> id;
    if (type == 1) {
      if (online.size() == k) {
        pop_heap(online.begin(), online.end(), [&](int32_t x, int32_t y) {
          return friendship[x - 1] > friendship[y - 1];
        });
        online.pop_back();
      }
      online.push_back(id);
      push_heap(online.begin(), online.end(), [&](int32_t x, int32_t y) {
        return friendship[x - 1] > friendship[y - 1];
      });
    }
    if (type == 2) {
      find(online.begin(), online.end(), id) != online.end()
          ? results.push_back("YES")
          : results.push_back("NO");
    }
  }
  for (string result : results) {
    cout << result << endl;
  }
}
