#include <bits/stdc++.h>
using namespace std;
bool solve() {
  int n;
  if (scanf("%d", &n) != -1) {
    int k, q;
    scanf("%d %d", &k, &q);
    std::vector<int> t(n);
    for (int i = 0; i < n; i++) {
      scanf("%d", &t[i]);
      t[i] = -t[i];
    }
    set<int> x;
    for (int i = 0; i < q; i++) {
      int a, b;
      scanf("%d %d", &a, &b);
      b--;
      if (a == 1) {
        x.insert(t[b]);
      } else {
        auto iter = x.begin();
        bool ok = false;
        for (int w = 0; w < k && iter != x.end(); w++, iter++) {
          if (*iter == t[b]) {
            ok = true;
          }
        }
        printf("%s\n", ok ? "YES" : "NO");
      }
    }
    return true;
  }
  return false;
}
int main() {
  auto t = clock() / CLOCKS_PER_SEC;
  while (solve()) {
    auto nt = clock() / CLOCKS_PER_SEC;
    cerr << "TIME: " << (nt - t) << endl;
    t = nt;
  }
  return 0;
}
