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;
const int NMAX = 150005;
int N, Q, K;
struct st {
  int val, ind;
};
st v[NMAX];
int AIB[NMAX], D[NMAX], is_on[NMAX];
bool cmp(struct st a, struct st b) { return a.val > b.val; }
int zero(int x) { return (x ^ (x - 1)) & x; }
void update(int x, int val) {
  for (int i = x; i <= N; i += zero(i)) AIB[i] += val;
}
int suma(int x) {
  int rez = 0;
  for (int i = x; i > 0; i -= zero(i)) rez += AIB[i];
  return rez;
}
int main() {
  cin >> N >> K >> Q;
  for (int i = 1; i <= N; ++i) {
    cin >> v[i].val;
    v[i].ind = i;
  }
  sort(v + 1, v + N + 1, cmp);
  for (int i = 1; i <= N; ++i) D[v[i].ind] = i;
  int tip, id;
  for (int i = 1; i <= Q; ++i) {
    cin >> tip >> id;
    if (tip == 1) {
      is_on[id] = 1;
      update(D[id], 1);
    } else {
      if (!is_on[id])
        cout << "NO\n";
      else if (suma(D[id]) <= K)
        cout << "YES\n";
      else
        cout << "NO\n";
    }
  }
  return 0;
}
