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>
#pragma warning(disable : 4996)
typedef struct _Node {
  int id;
  int t;
} Node;
int t[150001];
Node online[6] = {
    0,
};
int main() {
  int n, k, q, query, id, min_pos;
  Node temp;
  scanf("%d %d %d", &n, &k, &q);
  for (int i = 1; i <= n; i++) scanf("%d", t + i);
  for (int i = 0; i < q; i++) {
    scanf("%d %d", &query, &id);
    if (query == 1) {
      int j;
      for (j = 0; j < k; j++) {
        if (online[j].id == 0) {
          temp.id = id;
          temp.t = t[id];
          online[j] = temp;
          break;
        }
      }
      if (j == k) {
        temp.t = 2000000000;
        for (j = 0; j < k; j++) {
          if (online[j].t < temp.t) {
            temp.t = online[j].t;
            min_pos = j;
          }
        }
        temp.id = id;
        temp.t = t[id];
        online[min_pos] = temp;
      }
    } else {
      int j;
      for (j = 0; j < k; j++) {
        if (online[j].id == id) {
          printf("YES\n");
          break;
        }
      }
      if (j == k) printf("NO\n");
    }
  }
  return 0;
}
