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;
struct bear {
  uint64_t index;
  uint64_t value;
};
bool comp(struct bear b1, struct bear b2) { return b1.value > b2.value; }
int main(int argc, const char* argv[]) {
  uint64_t countf, size, countdata;
  cin >> countf >> size >> countdata;
  vector<struct bear> window;
  for (int i = 0; i < size; i++) {
    window.push_back({0, 0});
  }
  vector<struct bear> bears;
  bears.reserve(countf);
  for (uint64_t i = 0; i < countf; i++) {
    uint64_t val;
    cin >> val;
    bears.push_back({i, val});
  }
  for (uint64_t i = 0; i < countdata; i++) {
    int cmd;
    int index;
    cin >> cmd >> index;
    index--;
    if (cmd == 1) {
      for (int j = 0; j < window.size(); j++) {
        if (window[j].value < bears[index].value) {
          for (long long k = window.size() - 2; k >= j; k--) {
            window[k + 1] = window[k];
          }
          window[j] = bears[index];
          break;
        }
      }
    }
    if (cmd == 2) {
      int j;
      bool wrtn = false;
      for (j = 0; j < window.size(); j++) {
        if (j > size) {
          break;
        }
        if (window[j].index == index) {
          cout << "YES\n";
          wrtn = true;
          break;
        }
      }
      if (!wrtn) {
        cout << "NO\n";
      }
    }
  }
  return 0;
}
