#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, q, i, t[150005], f, type, id;
  set<pair<int, int> > s;
  cin >> n >> k >> q;
  for (i = 1; i <= n; i++) {
    cin >> t[i];
  }
  while (q--) {
    cin >> type >> id;
    if (type == 1) {
      s.insert(pair<int, int>(-t[id], id));
    } else {
      int f = 0;
      set<pair<int, int> >::iterator it;
      for (it = s.begin(), i = 0; it != s.end() && i < k; it++, i++) {
        if ((*it).second == id) {
          f = 1;
          cout << "YES\n";
          break;
        }
      }
      if (f == 0) {
        cout << "NO\n";
      }
    }
  }
  return 0;
}
