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 v[200005];
bool inQ[200005];
vector<pair<int, int> > foo;
int main() {
  int n, k, q, p, m, i, j;
  bool ok;
  pair<int, int> x;
  cin >> n >> k >> m;
  for (i = 1; i <= n; ++i) cin >> v[i];
  priority_queue<pair<int, int> > pq;
  for (j = 0; j < m; ++j) {
    cin >> q >> p;
    if (q == 1) {
      if (!inQ[p]) {
        pq.push({v[p], p});
        inQ[p] = 1;
      }
    } else {
      if (!inQ[p])
        ok = 0;
      else {
        ok = i = 0;
        while (!pq.empty() && i < k) {
          x = pq.top();
          pq.pop();
          foo.push_back(x);
          if (x.second == p) {
            ok = true;
            break;
          }
          ++i;
        }
        while (!foo.empty()) {
          pq.push(foo.back());
          foo.pop_back();
        }
      }
      if (ok == true)
        cout << "YES\n";
      else
        cout << "NO\n";
    }
  }
  return 0;
}
