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() {
  long long int n, k, q;
  cin >> n >> k >> q;
  set<pair<int, long long int>> s;
  map<long long int, pair<int, long long int>> m;
  for (int i = 0; i < n; i++) {
    long long int ti;
    cin >> ti;
    pair<int, long long int> f = {1, -ti};
    m[i + 1] = f;
    s.insert(f);
  }
  for (int i = 0; i < q; i++) {
    int type;
    long long int id;
    cin >> type >> id;
    if (type == 1) {
      auto temp = s.find(m[id]);
      pair<int, long long int> f = {0, temp->second};
      m[id] = f;
      s.insert(f);
    }
    if (type == 2) {
      auto temp = s.find(m[id]);
      if (distance(s.begin(), temp) < k)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
