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() {
  int t[150001], on[150001] = {0}, n, k, q, i, j, ans, x, id;
  cin >> n >> k >> q;
  vector<pair<int, int> > vect;
  for (int i = 0; i < n; i++) cin >> t[i];
  while (q--) {
    cin >> x >> id;
    id--;
    if (x == 1) {
      on[id] = 1;
      if (vect.size() < k) {
        vect.push_back(make_pair(t[id], id));
        sort(vect.rbegin(), vect.rend());
      } else {
        if (t[id] > vect[vect.size() - 1].first) {
          on[vect[vect.size() - 1].second] = 0;
          vect.pop_back();
          vect.push_back(make_pair(t[id], id));
          sort(vect.rbegin(), vect.rend());
        } else {
          continue;
        }
      }
    } else {
      if (on[id])
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
}
