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>
int main() {
  static int display[6], tt[150000];
  int n, k, q, i, cnt;
  scanf("%d%d%d", &n, &k, &q);
  for (i = 0; i < n; i++) scanf("%d", &tt[i]);
  cnt = 0;
  while (q--) {
    int type, id, imin, yes;
    scanf("%d%d", &type, &id), id--;
    if (type == 1) {
      imin = -1;
      if (cnt == k) {
        int min;
        min = 0x3f3f3f3f;
        for (i = 0; i < cnt; i++)
          if (min > display[i]) {
            imin = i;
            min = display[i];
          }
        if (tt[id] > min) display[imin] = tt[id];
      } else
        display[cnt++] = tt[id];
    } else {
      yes = 0;
      for (i = 0; i < cnt; i++)
        if (tt[id] == display[i]) {
          yes = 1;
          break;
        }
      printf(yes ? "YES\n" : "NO\n");
    }
  }
  return 0;
}
