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