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() {
  vector<int> v;
  int n, k, q, i, t[150005], type, id;
  while (cin >> n >> k >> q) {
    for (i = 1; i <= n; i++) cin >> t[i];
    for (i = 1; i <= q; i++) {
      cin >> type >> id;
      if (type == 1) {
        v.insert(upper_bound(v.begin(), v.end(), t[id]), t[id]);
      } else {
        if (!binary_search(v.begin(), v.end(), t[id]))
          cout << "NO\n";
        else {
          int p = upper_bound(v.begin(), v.end(), t[id]) - v.begin();
          if (v.size() - p + 1 <= k)
            cout << "YES\n";
          else
            cout << "NO\n";
        }
      }
    }
    v.clear();
  }
  return 0;
}
