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 const maxN = 2 * 1e5 + 10;
int n, k, q, nh, hp[maxN], t[maxN];
bool d[maxN];
void upH(int i) {
  int tp, j;
  tp = hp[i];
  while (1) {
    j = i / 2;
    if (j == 0) break;
    if (t[hp[j]] > t[tp]) {
      hp[i] = hp[j];
      i = j;
    } else
      break;
  }
  hp[i] = tp;
}
void downH(int i) {
  int tp, j;
  tp = hp[i];
  while (1) {
    j = i * 2;
    if (j > nh) break;
    if ((j < nh) && (t[hp[j + 1]] < t[hp[j]])) j++;
    if (t[hp[j]] < t[tp]) {
      hp[i] = hp[j];
      i = j;
    } else
      break;
  }
  hp[i] = tp;
}
int main() {
  scanf("%d %d %d", &n, &k, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &t[i]);
    d[i] = false;
  }
  nh = 0;
  bool ok = true;
  int tp, id;
  for (int i = 1; i <= q; i++) {
    scanf("%d%d", &tp, &id);
    if (tp == 1) {
      if (ok) {
        d[id] = true;
        nh++;
        hp[nh] = id;
        upH(nh);
        if (nh == k) ok = false;
      } else {
        if (t[hp[1]] < t[id]) {
          d[hp[1]] = false;
          d[id] = true;
          hp[1] = id;
          downH(1);
        }
      }
    } else {
      if (d[id])
        printf("YES");
      else
        printf("NO");
    }
  }
}
