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 fr[150100];
set<pair<int, int> > scr, _scr;
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  string ans[2] = {"NO", "YES"};
  int n, k, q, op, id;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; ++i) cin >> fr[i];
  for (int i = 0; i < q; ++i) {
    cin >> op >> id;
    if (op == 1) {
      if (_scr.size() == k && _scr.begin()->first < fr[id]) {
        scr.erase(pair<int, int>(_scr.begin()->second, _scr.begin()->first));
        _scr.erase(_scr.begin());
        scr.insert(pair<int, int>(id, fr[id]));
        _scr.insert(pair<int, int>(fr[id], id));
      } else {
        scr.insert(pair<int, int>(id, fr[id]));
        _scr.insert(pair<int, int>(fr[id], id));
      }
    } else {
      cout << ans[scr.count(pair<int, int>(id, fr[id]))] << "\n";
    }
  }
  return 0;
}
