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>
const int inf = (int)1e9;
using namespace std;
int n, k, q;
int t[200200];
int main() {
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &t[i]);
  }
  priority_queue<pair<int, int>, vector<pair<int, int> >,
                 greater<pair<int, int> > >
      pq;
  vector<pair<int, int> > v;
  for (int i = 0; i < q; i++) {
    int type, id;
    scanf("%d%d", &type, &id);
    if (type == 1) {
      pq.push(make_pair(t[id], id));
      while ((int)pq.size() > k) {
        pq.pop();
      }
    } else {
      v.clear();
      while (!pq.empty()) {
        v.push_back(pq.top());
        pq.pop();
      }
      for (int j = 0; j < (int)v.size(); j++) {
        pq.push(v[j]);
      }
      bool ok = false;
      for (int j = 0; j < (int)v.size(); j++) {
        if (v[j].second == id) {
          ok = true;
          break;
        }
      }
      if (ok) {
        printf("YES\n");
      } else
        printf("NO\n");
    }
  }
  return 0;
}
