#include <bits/stdc++.h>
using namespace std;
set<int> s;
int a[200005];
int main() {
  int n, k, q;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  while (q--) {
    int type, id;
    cin >> type >> id;
    if (type == 1) {
      s.insert(a[id]);
      if (s.size() > k) s.erase(s.begin());
    } else {
      if (s.find(a[id]) == s.end())
        cout << "NO" << endl;
      else
        cout << "YES" << endl;
    }
  }
}
