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() {
  long long n, k, q;
  cin >> n >> k >> q;
  long long t[n], table[n];
  for (long long i = 0; i < n; i++) cin >> t[i];
  int type;
  long long id, count = 0, _min = INT_MAX, pos;
  for (long long i = 0; i < n; i++) table[i] = 0;
  for (long long Q = 0; Q < q; Q++) {
    cin >> type >> id;
    if (type == 1) {
      if (count >= k) {
        if (t[id - 1] > t[pos]) {
          table[id - 1] = 1;
          table[pos] = 0;
        }
      } else
        table[id - 1] = 1;
      count++;
      if (t[id - 1] < _min) {
        _min = t[id - 1];
        pos = id - 1;
      }
    } else {
      if (table[id - 1] == 1)
        cout << "YES" << endl;
      else {
        cout << "NO" << endl;
      }
    }
  }
  return 0;
}
