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;
struct pp {
  int id, zhi;
} p[160000];
struct pai {
  int id, zhi;
} aa[10];
int main() {
  int n, k, q;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i].zhi);
    p[i].id = i;
  }
  for (int i = 0; i < q; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    if (x == 1) {
      int biao = 0;
      for (int i = 0; i < 6; i++) {
        if (aa[i].zhi < p[y].zhi) {
          biao = i;
          break;
        }
      }
      if (biao > 5) continue;
      for (int i = 6; i >= biao; i--) {
        aa[i] = aa[i - 1];
      }
      aa[biao].zhi = p[y].zhi;
      aa[biao].id = p[y].id;
    } else {
      int biao = 0;
      for (int i = 0; i < k; i++) {
        if (aa[i].zhi == p[y].zhi) {
          printf("YES\n");
          biao = 1;
          break;
        }
      }
      if (biao == 0) printf("NO\n");
    }
  }
  return 0;
}
