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 a[200000], b[6];
bool ByNum(int p, int q) { return a[p] < a[q]; }
int main() {
  int x, y, n, k, q, i, j;
  cin >> n >> k >> q;
  for (i = 0; i < 6; i++) {
    b[i] = 0;
  }
  a[0] = -1;
  for (i = 1; i <= n; i++) cin >> a[i];
  for (i = 0; i < q; i++) {
    cin >> x >> y;
    if (x == 1) {
      for (j = 0; j < k; j++) {
        if (a[b[j]] < a[y]) {
          b[0] = y;
          break;
        }
      }
      sort(b, b + k, ByNum);
    }
    if (x == 2) {
      bool f = 0;
      for (j = 0; j < k; j++) {
        if (b[j] == y) {
          cout << "YES" << endl;
          f = 1;
          break;
        }
      }
      if (!f) cout << "NO" << endl;
    }
  }
  return 0;
}
