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;
  int a[100009];
  vector<pair<int, int> > v;
  cin >> n >> k >> q;
  int x;
  for (i = 1; i <= n; i++) {
    cin >> x;
    a[i] = x;
  }
  int type, fr;
  while (q--) {
    cin >> type >> fr;
    if (type == 1) {
      v.push_back(make_pair(a[fr], fr));
      sort(v.begin(), v.end());
      if (v.size() > k) v.pop_back();
    } else {
      int flg = 0;
      for (i = 0; i < v.size(); i++) {
        if (fr == v[i].second) {
          cout << "YES" << endl;
          flg = 1;
          break;
        }
      }
      if (flg == 0) {
        cout << "NO" << endl;
      }
    }
  }
  return 0;
}
