#include <bits/stdc++.h>
using namespace std;
int t[222222];
int main() {
  int n, k, q;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 0; i < n; i++) scanf("%d", &t[i]);
  set<pair<int, int> > fs;
  set<int> ids;
  while (q-- > 0) {
    int tp, id;
    scanf("%d%d", &tp, &id);
    --id;
    if (tp == 2) {
      if (ids.find(id) != ids.end()) {
        cout << "YES\n";
      } else {
        cout << "NO\n";
      }
    } else {
      fs.insert({t[id], id});
      ids.insert(id);
      if (fs.size() > k) {
        pair<int, int> p = *fs.begin();
        fs.erase(p);
        ids.erase(p.second);
      }
    }
  }
  return 0;
}
