#include <bits/stdc++.h>
using namespace std;
int n, q, k, a[1000001], i, j;
set<int> online;
int main() {
  cin >> n >> k >> q;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (j = 1; j <= q; j++) {
    int x, id;
    cin >> id >> x;
    if (id == 1)
      online.insert(a[x]);
    else {
      set<int>::iterator it;
      it = online.find(a[x]);
      if (it != online.end()) {
        cout << "YES" << endl;
      } else
        cout << "NO" << endl;
    }
    if (online.size() > k) online.erase(online.begin());
  }
  return 0;
}
