#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, q, type, id;
  cin >> n >> k >> q;
  vector<int> t(n, 0);
  vector<int> win(k, -1);
  for (int i = 0; i < n; i++) cin >> t[i];
  for (int j = 0; j < q; j++) {
    cin >> type >> id;
    id--;
    if (type == 1) {
      int place = k - 1;
      while (place >= 0 && (win[place] == -1 || t[win[place]] < t[id])) {
        place--;
      }
      place++;
      for (int i = k - 1; i > place; i--) {
        win[i] = win[i - 1];
      }
      win[place] = id;
    } else {
      bool flag = false;
      for (int i = 0; i < k; i++) {
        if (win[i] == id) flag = true;
      }
      cout << (flag ? "YES" : "NO") << endl;
    }
  }
  return 0;
}
