#include <bits/stdc++.h>
using namespace std;
int fr[150150];
bool online[150150];
int main() {
  cout.precision(0);
  int n, k, q;
  cin >> n >> k >> q;
  for (int i = 0; i < n; ++i) cin >> fr[i + 1];
  priority_queue<int> onl;
  for (int i = 0; i < q; ++i) {
    int a, b;
    cin >> a >> b;
    if (a == 1) {
      online[b] = 1;
      if (onl.size() < k) {
        onl.push(-fr[b]);
      } else if (onl.size() == k && -onl.top() < fr[b]) {
        onl.pop();
        onl.push(-fr[b]);
      }
    } else {
      if (!onl.size()) {
        cout << "NO" << endl;
        continue;
      }
      if (-onl.top() <= fr[b] && online[b])
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
