#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, q;
  cin >> n >> k >> q;
  int t[n];
  for (int i = 0; i < n; i++) cin >> t[i];
  int ty, id;
  vector<int> screen;
  while (q--) {
    cin >> ty >> id;
    id--;
    if (ty == 2) {
      if (binary_search(screen.begin(), screen.end(), t[id]))
        puts("YES");
      else
        puts("NO");
    } else {
      if (screen.size() == k) {
        screen[0] = max(screen[0], t[id]);
      } else {
        screen.push_back(t[id]);
      }
      sort(screen.begin(), screen.end());
    }
  }
  return 0;
}
