#include <bits/stdc++.h>
using namespace std;
void ti() {}
int main() {
  ti();
  int n, k, q;
  cin >> n >> k >> q;
  vector<int> v = {0};
  while (n--) {
    int a2;
    cin >> a2;
    v.push_back(a2);
  }
  set<int> s1;
  while (q--) {
    int type, id;
    cin >> type >> id;
    if (type == 1) {
      s1.insert(v[id]);
      if (s1.size() > k) {
        s1.erase(s1.begin());
      }
    } else if (type == 2) {
      const bool is_in = s1.find(v[id]) != s1.end();
      if (is_in) {
        cout << "YES\n";
      } else {
        cout << "NO\n";
      }
    }
  }
  return 0;
}
