#include <bits/stdc++.h>
using namespace std;
int t[300005];
int main() {
  int n, k, q;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &t[i + 1]);
  }
  set<int> s;
  for (int i = 0; i < q; ++i) {
    int type, x;
    scanf("%d%d", &type, &x);
    if (type == 1) {
      s.insert(t[x]);
    } else {
      auto itr = s.find(t[x]);
      if (itr == s.end()) {
        cout << "NO" << endl;
        continue;
      }
      for (int j = 0; j < k; ++j) {
        if (itr != s.end()) itr++;
      }
      cout << (itr == s.end() ? "YES" : "NO") << endl;
    }
  }
}
