#include <bits/stdc++.h>
using namespace std;
int n, k, q;
int main() {
  cin >> n >> k >> q;
  priority_queue<int, vector<int>, std::greater<int>> Q;
  vector<int> a;
  vector<bool> mark;
  mark.assign(n + 1, false);
  a.push_back(0);
  for (int i = 0; i < n; ++i) {
    int w;
    cin >> w;
    a.push_back(w);
  }
  int Qmin = INT_MAX;
  for (int i = 0; i < q; ++i) {
    int type, id;
    cin >> type >> id;
    if (type == 1) {
      mark[id] = true;
      if (Q.size() < k) {
        Q.push(a[id]);
      } else {
        if (a[id] > Q.top()) {
          Q.pop();
          Q.push(a[id]);
        }
      }
    } else {
      if (!Q.empty() && a[id] >= Q.top() && mark[id]) {
        cout << "YES\n";
      } else {
        cout << "NO\n";
      }
    }
  }
  return 0;
}
