#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, k, q;
  cin >> n >> k >> q;
  int t[n + 1];
  for (int i = 1; i <= n; i++) {
    cin >> t[i];
  }
  priority_queue<pair<int, int> > qu;
  while (q--) {
    int ch, id;
    cin >> ch >> id;
    if (ch == 1) {
      qu.push(pair<int, int>(t[id], id));
    } else {
      pair<int, int> temp[k];
      int count = 0;
      bool found = false;
      for (count = 0; count < k && !qu.empty(); count++) {
        temp[count] = qu.top();
        qu.pop();
        if (temp[count].second == id) {
          cout << "YES" << endl;
          found++;
        }
      }
      if (!found) {
        cout << "NO" << endl;
      }
      for (int i = 0; i < count; i++) {
        qu.push(temp[i]);
      }
    }
  }
  return 0;
}
