#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, q;
  cin >> n >> k >> q;
  vector<int> vec;
  while (n) {
    int tmp;
    cin >> tmp;
    vec.push_back(tmp);
    n--;
  }
  set<int> st;
  while (q) {
    int type;
    cin >> type;
    int id;
    cin >> id;
    if (type == 1) {
      st.insert(vec[id - 1]);
      if (st.size() > k) {
        st.erase(st.begin());
      }
    } else {
      if (vec[id - 1] < *(st.begin()))
        cout << "NO" << endl;
      else {
        if (st.find(vec[id - 1]) != st.end()) {
          cout << "YES" << endl;
        } else {
          cout << "NO" << endl;
        }
      }
    }
    q--;
  }
}
