#include <bits/stdc++.h>
using namespace std;
struct User {
  int id;
  int t;
  bool status;
  bool in_zapros;
};
int n, k, q;
int gl[150000];
deque<int> deq;
void add(int id);
bool is(int id);
int main() {
  cin >> n >> k >> q;
  k = min(6, k);
  for (int i = 0; i < n; ++i) cin >> gl[i];
  for (int i = 0; i < q; ++i) {
    int a, b;
    cin >> a >> b;
    if (a == 1)
      add(b - 1);
    else
      cout << (is(b - 1) ? "YES" : "NO") << endl;
  }
  return 0;
}
void add(int id) {
  deq.push_back(id);
  sort(deq.begin(), deq.end(), [](int a, int b) { return gl[a] > gl[b]; });
  if (deq.size() > k) deq.pop_back();
}
bool is(int id) {
  for (int i = 0; i < deq.size(); ++i)
    if (deq[i] == id) return true;
  return false;
}
