#include <bits/stdc++.h>
using namespace std;
int main() {
  priority_queue<pair<int, int> > qu;
  int n, k, q;
  cin >> n >> k >> q;
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  for (int z = 0; z < q; z++) {
    int a, b;
    cin >> a >> b;
    if (a == 1) {
      qu.push(make_pair(v[b - 1], b));
    } else {
      bool t = false;
      vector<pair<int, int> > c(k);
      int s = min(k, int(qu.size()));
      for (int i = 0; i < s; i++) {
        c.push_back(qu.top());
        if (qu.top().second == b) t = true;
        qu.pop();
      }
      if (t) {
        cout << "YES" << endl;
      } else {
        cout << "NO" << endl;
      }
      for (int i = 0; i < c.size(); i++) qu.push(c[i]);
    }
  }
}
