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>
struct Friend {
  int id;
  int t;
} frien[115], t;
void sort(int sta, int end) {
  int i, j;
  for (i = sta; i <= end; i++) {
    for (j = i + 1; j <= end; j++) {
      if (frien[i].t <= frien[j].t) {
        t = frien[i];
        frien[i] = frien[j];
        frien[j] = t;
      }
    }
  }
}
int main() {
  printf("Hello");
  int online_people_id[115];
  int n, k, q, flag;
  int i, o_p;
  scanf("%d%d%d", &n, &k, &q);
  for (i = 1; i <= n; i++) {
    frien[i].id = i;
    scanf("%d", &frien[i].t);
  }
  sort(1, n);
  int typ, id;
  o_p = 0;
  for (i = 1; i <= q; i++) {
    scanf("%d%d", &typ, &id);
    if (typ == 1) {
      online_people_id[o_p++] = id;
      continue;
    } else {
      flag = 1;
      for (int i = 0; i < o_p; i++) {
        if (id != online_people_id[i]) {
          flag = 0;
        } else {
          flag = 1;
          break;
        }
      }
      if (flag == 0) {
        printf("NO\n");
        continue;
      }
      if (o_p <= k)
        flag = 1;
      else {
        for (int i = 1; i <= k; i++) {
          if (id != frien[i].id)
            flag = 0;
          else {
            flag = 1;
            break;
          }
        }
      }
      if (flag)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
}
