#include <bits/stdc++.h>
using namespace std;
int t[150007];
set<pair<int, int> > s;
set<pair<int, int> >::reverse_iterator it;
int main() {
  int n, k, q, tp, id;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; ++i) cin >> t[i];
  while (q--) {
    cin >> tp >> id;
    if (tp == 1) {
      s.insert(make_pair(t[id], id));
    } else {
      bool ok = false;
      int i = 0;
      for (it = s.rbegin(); i < k && it != s.rend(); ++i, ++it) {
        if ((*it).second == id) {
          ok = true;
          break;
        }
      }
      if (ok)
        cout << "YES\n";
      else
        cout << "NO\n";
    }
  }
  return 0;
}
