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 main() {
  int n, k, q, i, j, a, b, x, ara[100004], arr[100004], ar[100005], v;
  while (scanf("%d %d %d", &n, &k, &q) == 3) {
    for (i = 0; i < n; i++) scanf("%d", &ara[i]);
    x = 0;
    for (i = 0; i < q; i++) {
      scanf("%d %d", &a, &b);
      if (a == 1) {
        arr[x++] = b;
        if (x > k) {
          v = 0;
          for (j = 0; j < x; j++) ar[v++] = ara[arr[j] - 1];
          sort(ar, ar + v);
          for (j = 0; j < x; j++) {
            if (ara[arr[j] - 1] == ar[0]) {
              arr[j] = -1;
              break;
            }
          }
        }
      }
      if (a == 2) {
        int flag = 0;
        for (j = 0; j < x; j++) {
          if (arr[j] == b) {
            flag = 1;
            break;
          }
        }
        if (flag == 1)
          printf("YES\n");
        else
          printf("NO\n");
      }
    }
  }
  return 0;
}
