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 sum[150010 << 2], vis[150010];
void push_up(int o) { sum[o] = sum[o << 1] + sum[o << 1 | 1]; }
void update(int o, int l, int r, int pos) {
  int m = (l + r) >> 1;
  if (l == r) {
    sum[o] = 1;
    return;
  }
  if (pos <= m)
    update(o << 1, l, m, pos);
  else
    update(o << 1 | 1, m + 1, r, pos);
  push_up(o);
}
int query(int o, int l, int r, int s, int t) {
  if (l >= s && r <= t) {
    return sum[o];
  }
  int m = (l + r) >> 1;
  int ans = 0;
  if (m >= s) ans += query(o << 1, l, m, s, t);
  if (m < t) ans += query(o << 1 | 1, m + 1, r, s, t);
  return ans;
}
int val[150010], b[150010], c[150010], mp[150010];
int main() {
  int n, k, q, op, id;
  memset(vis, 0, sizeof(vis));
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) cin >> val[i], b[i - 1] = val[i];
  sort(b, b + n);
  for (int i = 1; i <= n; i++) {
    val[i] = n - (lower_bound(b, b + n, val[i]) - b);
  }
  memset(sum, 0, sizeof(sum));
  for (int i = 0; i < q; i++) {
    cin >> op >> id;
    if (op == 1) {
      update(1, 1, n, val[id]);
      vis[val[id]] = 1;
    } else {
      if (!vis[val[id]])
        puts("NO");
      else {
        if (query(1, 1, n, 1, val[id]) <= k)
          puts("YES");
        else
          puts("NO");
      }
    }
  }
  return 0;
}
