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;
  vector<long long> t(n);
  for (long long i = 0; i < n; i++) {
    cin >> t[i];
  }
  vector<long long> bear;
  while (q--) {
    long long act, b;
    cin >> act >> b;
    if (act == 1) {
      bear.push_back(t[b - 1]);
    } else {
      sort(bear.rbegin(), bear.rend());
      for (int i = bear.size() - k; i > 0; i--) {
        bear.pop_back();
      }
      long long l = 0, r = (long long)bear.size() - 1;
      if (r >= 0) {
        if (bear[r] == t[b - 1]) {
          cout << "YES" << endl;
          continue;
        }
        if (bear[l] == t[b - 1]) {
          cout << "YES" << endl;
          continue;
        }
      }
      while (r - l > 1) {
        long long mid = (r + l) / 2;
        if (bear[mid] <= t[b - 1]) {
          l = mid;
        } else {
          r = mid;
        }
      }
      if (r >= 0) {
        if (bear[l] == t[b - 1]) {
          cout << "YES" << endl;
          continue;
        }
      }
      cout << "NO" << endl;
    }
  }
  return 0;
}
