#include <bits/stdc++.h>
using namespace std;
int main() {
  int t[150001], on[150001] = {0}, n, k, q, i, j, ans, x, id, cnt = 0;
  priority_queue<pair<int, int>, vector<pair<int, int> >,
                 greater<pair<int, int> > >
      pq;
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) cin >> t[i];
  while (q--) {
    cin >> x >> id;
    id--;
    if (x == 1) {
      on[id] = 1;
      if (cnt < k) {
        pq.push(make_pair(t[id], id));
        cnt++;
      } else {
        pair<int, int> popx = pq.top();
        pq.pop();
        if (t[id] > popx.first) {
          on[popx.second] = 0;
          pq.push(make_pair(t[id], id));
        } else {
          on[id] = 0;
          pq.push(popx);
          continue;
        }
      }
    } else {
      if (on[id])
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
}
