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;
long long int color[150001], arr[150001];
int main() {
  long long int koyta, quere, sz, i, j, k, cnt, chk[10], pos, sel, indx, val,
      mn;
  cin >> koyta >> sz >> quere;
  memset(color, 0, sizeof(color));
  for (i = 1; i <= koyta; i++) {
    cin >> arr[i];
  }
  k = 0;
  for (i = 1; i <= quere; i++) {
    cin >> sel >> indx;
    if (sel == 1) {
      val = arr[indx];
      if (k < sz) {
        color[indx] = 1;
        chk[++k] = indx;
      } else {
        mn = 0x3f3f3f3f;
        int paisi = 0;
        for (j = 1; j <= k; j++) {
          if (val > arr[chk[j]]) {
            if (mn > arr[chk[j]]) {
              pos = j;
              mn = min(mn, arr[chk[j]]);
              paisi = 1;
            }
          }
        }
        if (paisi == 1) {
          color[chk[pos]] = 0;
          color[indx] = 1;
          chk[pos] = indx;
        }
      }
    } else if (sel == 2) {
      if (color[indx] == 1) {
        printf("YES\n");
      } else {
        printf("NO\n");
      }
    }
  }
  return 0;
}
