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;
priority_queue<pair<int, int> > pq;
bool vis[1000000] = {0};
int t[1000000];
int a[10], b[10];
int main() {
  int n, q, k, i, j, type, id;
  cin >> n >> k >> q;
  for (i = 1; i <= n; i++) cin >> t[i];
  while (q--) {
    cin >> type >> id;
    if (type == 1 && vis[id] == 0) {
      vis[id] = 1;
      pq.push(make_pair(t[id], id));
    } else if (type == 2) {
      int l = 1;
      bool f = 0;
      while (!pq.empty() && l <= k) {
        if (pq.top().second == id) {
          f = 1;
          break;
        }
        a[l] = t[pq.top().second];
        b[l] = pq.top().second;
        pq.pop();
        l++;
      }
      for (i = 1; i < l; i++) pq.push(make_pair(a[i], b[i]));
      if (f == 1)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
