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 n, k, q, i, j, kontrol, type, yer, id, t[150005], cvp[10];
void cikar();
int main() {
  scanf("%d %d %d", &n, &k, &q);
  for (i = 0; i < n; i++) scanf("%d", &t[i]);
  for (i = 0; i < q; i++) {
    scanf("%d %d", &type, &id);
    if (type == 1) {
      cvp[yer++] = id;
      if (yer > k) {
        cikar();
      }
    } else {
      kontrol = 0;
      for (j = 0; j < yer; j++)
        if (cvp[j] == id) kontrol = 1;
      if (kontrol)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
void cikar() {
  int i, mn = 1000000005, ind, a[10] = {0}, place = 0;
  for (i = 0; i < yer; i++) {
    if (t[cvp[i] - 1] < mn) {
      mn = t[cvp[i] - 1];
      ind = i;
    }
  }
  for (i = 0; i < yer; i++) {
    if (i != ind) a[place++] = cvp[i];
    cvp[i] = 0;
  }
  for (i = 0; i < 10; i++) cvp[i] = a[i];
  yer--;
  return;
}
