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 a[150005];
int main() {
  int t, i, j, c, k, l, m, n, o, p, a[55] = {0}, b[55] = {0}, lim, rad, q, on,
                                    lo, op, id, top, ids[10] = {0},
                                    ts[10] = {1000000009}, ind, flg;
  map<int, int> mp;
  scanf("%d", &n);
  scanf("%d", &k);
  scanf("%d", &q);
  for (i = 1; i < n + 1; i++) scanf("%d", &a[i]);
  top = k;
  on = 0;
  ind = 0;
  for (i = 1; i < q + 1; i++) {
    scanf("%d", &op);
    scanf("%d", &id);
    if (op == 1) {
      if (on < top) {
        ids[ind] = id;
        ts[ind] = a[id];
        ind++;
        on++;
      } else {
        lo = min(
            ts[1],
            min(ts[2], min(ts[3], min(ts[4], min(ts[5], min(ts[6], ts[0]))))));
        if (a[id] > lo)
          for (p = 0; p < 7; p++)
            if (ts[p] == lo) ts[p] = a[id];
      }
    } else {
      flg = 0;
      for (j = 0; j < top; j++)
        if (ts[j] == a[id]) flg = 1;
      if (flg == 1)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
