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 screen[150005] = {0};
int t[150005] = {0};
bool cmp(int a, int b) { return t[a] > t[b]; }
int main(void) {
  int n, q, k;
  scanf("%d%d%d", &n, &k, &q);
  int i = 0;
  for (i = 1; i <= n; i++) scanf("%d", &t[i]);
  int type, id;
  int pos = 1;
  for (i = 1; i <= q; i++) {
    scanf("%d%d", &type, &id);
    if (type == 1) {
      pop_heap(&screen[0], &screen[k], cmp);
      if (t[screen[k - 1]] < t[id]) {
        screen[k - 1] = id;
        push_heap(&screen[0], &screen[k], cmp);
      }
    }
    if (type == 2) {
      int j = 0;
      int pointer = 1;
      for (j = 0; j <= k; j++)
        if (screen[j] == id) {
          printf("YES\n");
          pointer = 0;
          break;
        }
      if (pointer) printf("NO\n");
    }
  }
  return 0;
}
