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 N = 200001, Q = 2001;
struct p {
  int x, p;
} t[200001];
;
bool cmp(p p1, p p2) { return p1.x < p2.x; };
bool cmp1(p p1, p p2) { return p1.p < p2.p; };
int n, q, k, tre[4 * N], w, x, y, kol, koll;
int a[N];
void upd(int k) {
  while (k) {
    k /= 2;
    tre[k] = tre[k * 2 + 1] + tre[k * 2];
  }
}
int getsum(int l, int r) {
  int sum = 0;
  while (l <= r) {
    if (l & 1) sum += tre[l];
    if (!(r & 1)) sum += tre[r];
    r = (r - 1) / 2, l = (l + 1) / 2;
  }
  return sum;
}
int ko[N];
int main() {
  cin >> n >> k >> q;
  int sz = 1;
  for (int i = 1; i <= n; i++) cin >> t[i].x, t[i].p = i;
  sort(t + 1, t + n + 1, cmp);
  for (int i = 1; i <= n; i++)
    if (t[i].x != t[i - 1].x)
      ko[i] = ++kol;
    else
      ko[i] = kol;
  while (sz <= ko[n]) sz *= 2;
  sort(t + 1, t + n + 1, cmp1);
  for (int i = 1; i <= q; i++) {
    cin >> x >> y;
    if (x == 1) {
      tre[y + sz - 1] = 1;
      upd(y + sz - 1);
    } else {
      if (getsum(y + sz - 1, sz + sz - 1) <= k && tre[y + sz - 1])
        cout << "YES\n";
      else
        cout << "NO\n";
    }
  }
  return 0;
}
