#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k, q, c = 0;
  cin >> n >> k >> q;
  vector<long long> v(n);
  set<pair<long long, long long>> w;
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  for (int i = 0; i < q; i++) {
    long long a, b;
    cin >> a >> b;
    if (a == 1) {
      w.insert(make_pair(v[b - 1], b));
      if (w.size() > k) w.erase(w.begin());
    } else {
      if (find(w.begin(), w.end(), make_pair(v[b - 1], b)) != w.end())
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
