#include <bits/stdc++.h>
using std::map;
using std::queue;
using std::set;
using std::string;
using std::vector;
const double kEps = 10e-8;
const int kMax = 1000;
const int kInf = 1 << 30;
struct Friend {
  int id, value;
  bool operator<(const Friend& that) const { return value < that.value; }
  bool operator>(const Friend& that) const { return value > that.value; }
};
int main() {
  int n, k, q;
  std::cin >> n >> k >> q;
  std::priority_queue<Friend, vector<Friend>, std::greater<Friend>> Q;
  map<int, bool> in;
  vector<int> T(n);
  for (int& t : T) {
    std::cin >> t;
  }
  while (q--) {
    int type, id;
    std::cin >> type >> id;
    if (type == 1) {
      in[id] = true;
      Q.push({id, T[id - 1]});
    } else {
      while (Q.size() > k) {
        Friend top = Q.top();
        Q.pop();
        in[top.id] = false;
      }
      if (in[id]) {
        std::cout << "YES\n";
      } else {
        std::cout << "NO\n";
      }
    }
  }
  return EXIT_SUCCESS;
}
