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() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, k, q;
  cin >> n >> k >> q;
  vector<long long> v(n);
  for (long long i = 0; i < n; ++i) cin >> v[i];
  set<pair<long long, long long> > s;
  long long query, id_;
  vector<pair<long long, long long> > res;
  for (long long i = 0; i < q; ++i) {
    cin >> query >> id_;
    if (query == 1) {
      res.push_back(make_pair(-v[id_ - 1], id_));
      if (res.size() > k) {
        sort(res.begin(), res.end());
        res.erase(res.begin() + k, res.end());
      }
    } else {
      long long max_ = (res.size() < k) ? (res.size()) : (k);
      for (long long j = 0; j < max_; ++j) {
        if (res[j].second == id_) {
          cout << "YES" << '\n';
          break;
        }
        if (j == (res.size() - 1)) cout << "NO" << '\n';
      }
    }
  }
  return 0;
}
