#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, q;
  cin >> n >> k >> q;
  int rq;
  int id;
  int last = INT_MAX;
  set<int> on;
  vector<int> r(n + 1);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &r[i]);
  }
  int rg;
  last = 0;
  while (cin >> rg) {
    cin >> id;
    if (rg == 1) {
      if (on.size() < k) {
        on.insert(r[id]);
      } else if (r[id] > *on.begin()) {
        on.erase(on.begin());
        on.insert(r[id]);
      }
    } else {
      if (on.find(r[id]) != on.end()) {
        printf("YES\n");
      } else {
        printf("NO\n");
      }
    }
  }
}
