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 out[150001], p[150001];
int on[6], m;
void px(int n) {
  for (int i = 0; i < m; i++) {
    if (n > on[i]) {
      for (int j = m - 1; j > i; j--) {
        on[j] = on[j - 1];
      }
      on[i] = n;
      break;
    }
  }
  return;
}
int main(void) {
  int n, t;
  scanf("%d%d%d", &n, &m, &t);
  for (int i = 0; i < n; i++) {
    scanf("%d", &out[i]);
  }
  int t1, t2, t3 = 0;
  for (int i = 0; i < t; i++) {
    scanf("%d%d", &t1, &t2);
    if (t1 == 1) {
      px(out[t2 - 1]);
    } else if (t1 == 2) {
      for (int j = 0; j < m; j++) {
        if (on[j] == out[t2 - 1]) {
          p[t3] = 1;
        }
      }
      t3++;
    }
  }
  for (int i = 0; i < t3; i++) {
    if (p[i] == 1) {
      printf("YES");
    } else {
      printf("NO");
    }
    printf("\n");
  }
  return 0;
}
