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 main() {
  struct friends {
    int tid;
    int relation;
    int status;
  };
  struct query {
    int quer1;
    int quer2;
  };
  int n, k, q;
  int i, j, m;
  int count = 0;
  int min = 0, minindex = 0;
  scanf("%d %d %d", &n, &k, &q);
  struct friends friendslist[n];
  struct query queries[q];
  for (i = 1; i <= n; i++) {
    scanf("%d", &friendslist[i].relation);
    friendslist[i].status = 0;
  }
  for (i = 1; i <= q; i++) {
    scanf("%d ", &queries[i].quer1);
    scanf("%d", &queries[i].quer2);
  }
  for (i = 1; i <= q; i++) {
    if (queries[i].quer1 == 1) {
      if (count < k) {
        friendslist[queries[i].quer2].status = 1;
        count++;
      } else {
        min = 0;
        for (j = 1; j <= n; j++) {
          if (friendslist[j].status == 1) {
            min = friendslist[j].relation;
            break;
          }
        }
        for (j = 1; j <= n; j++) {
          if (friendslist[j].relation < min) {
            min = friendslist[j].relation;
            minindex = j;
          }
        }
        if (friendslist[queries[i].quer2].relation >
            friendslist[minindex].relation) {
          friendslist[queries[i].quer2].status = 1;
          friendslist[minindex].status = 0;
        } else {
          friendslist[queries[i].quer2].status = 0;
          friendslist[minindex].status = 1;
        }
      }
    }
    if (queries[i].quer1 == 2) {
      printf("\n");
      if (friendslist[queries[i].quer2].status == 1)
        printf("YES");
      else
        printf("NO");
    }
  }
}
