#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
  int n, k, q, t[150000];
  set<long long> cur;
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) cin >> t[i];
  for (int i = 0; i < q; i++) {
    int type, id;
    scanf("%d%d", &type, &id);
    if (type == 1) {
      cur.insert(t[id - 1]);
      if (cur.size() > k) cur.erase(cur.begin());
    } else {
      if (cur.find(t[id - 1]) != cur.end()) {
        cout << "YES" << endl;
      } else
        cout << "NO" << endl;
    }
  }
  return 0;
}
