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;
struct node {
  int x, y;
  node(int x = 0, int y = 0) : x(x), y(y) {}
};
void create(vector<int>& v, int n) { v.assign(n + 1, 0); }
int rsq(vector<int>& v, int a, int b) {
  if (a == 0) {
    int sum = 0;
    for (; b >= 0; b = (b & (b + 1)) - 1) {
      sum += v[b];
    }
    return sum;
  } else {
    return rsq(v, 0, b) - rsq(v, 0, a - 1);
  }
}
void adjust(vector<int>& t, int k, int value) {
  for (; k <= t.size(); k |= k + 1) {
    t[k] += value;
  }
}
int visited[200000];
int main() {
  ios::sync_with_stdio(false);
  int x, n, k, q, id;
  cin >> n >> k >> q;
  vector<int> ft, friendsList;
  vector<pair<int, int> > friends;
  map<int, int> bib;
  create(ft, n + 10);
  for (int i = 0; i < n; i++) {
    cin >> x;
    friends.push_back(make_pair(x, i));
    friendsList.push_back(x);
  }
  sort(friends.begin(), friends.end());
  reverse(friends.begin(), friends.end());
  for (int i = 0; i < n; i++) {
    bib.insert(make_pair(friends[i].first, i + 1));
  }
  for (int i = 0; i < q; i++) {
    cin >> x >> id;
    if (x & 1) {
      if (visited[id]) continue;
      visited[id] = 1;
      int f = friendsList[id - 1];
      adjust(ft, bib[f], 1);
    } else {
      if (!visited[id]) {
        cout << "NO" << endl;
        continue;
      }
      int f = friendsList[id - 1];
      int flag = rsq(ft, 1, bib[f]);
      cout << ((flag <= k) ? "YES" : "NO") << endl;
    }
  }
  return 0;
}
