#include <bits/stdc++.h>
using namespace std;
int n, q, k, t[150050], foo, id, k_current;
map<int, int> M;
std::map<int, int>::iterator it;
int main() {
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) cin >> t[i];
  for (int i = 1; i <= q; i++) {
    cin >> foo >> id;
    if (foo == 1) {
      M[t[id]] = id;
      k_current++;
      if (k_current > k) {
        it = M.lower_bound(0);
        M.erase(it);
      }
    } else {
      if (M.count(t[id]) > 0)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
