#include <bits/stdc++.h>
using namespace std;
long long int cost[300005];
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, k, q;
  cin >> n >> k >> q;
  for (long long int i = 1; i <= n; i++) {
    cin >> cost[i];
  }
  set<pair<long long int, long long int> > se;
  while (q--) {
    long long int x, y;
    cin >> x >> y;
    if (x == 1) {
      pair<long long int, long long int> x = {cost[y], y};
      se.insert(x);
      if (se.size() > k) {
        auto it = se.begin();
        se.erase(*it);
      }
    } else {
      pair<long long int, long long int> x = {cost[y], y};
      if (se.find(x) != se.end()) {
        cout << "YES" << endl;
      } else
        cout << "NO" << endl;
    }
  }
  return 0;
}
