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() {
  int n, k, q;
  cin >> n >> k >> q;
  set<pair<int, int> > window;
  vector<int> ids(n, 0);
  for (int i = 0; i < n; i++) {
    cin >> ids[i];
  }
  vector<int> in_window(n, 0);
  for (int i = 0; i < q; i++) {
    int it, x;
    cin >> it >> x;
    x--;
    auto v = *window.begin();
    if (it == 1) {
      if (window.size() < k) {
        window.insert({ids[x], x});
        in_window[x] = 1;
      } else if (ids[x] > v.first) {
        window.erase(v);
        in_window[v.second] = 0;
        window.insert({ids[x], x});
        in_window[x] = 1;
      }
    } else {
      if (in_window[x]) {
        cout << "YES" << endl;
      } else {
        cout << "NO" << endl;
      }
    }
  }
}
