#include <bits/stdc++.h>
using namespace std;
int n, q, k, x, y;
map<int, int> P;
set<pair<int, int> > C;
int main() {
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) {
    int temp;
    cin >> temp;
    P[i] = temp;
  }
  while (q--) {
    cin >> x >> y;
    if (x == 1) {
      C.insert({P[y], y});
      if (C.size() > k) C.erase(*C.begin());
    } else
      puts((C.find({P[y], y}) != C.end()) ? "YES" : "NO");
  }
}
