#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, q, k, x, y;
  priority_queue<int, vector<int>, greater<int> > pq;
  set<int> st;
  cin >> n >> k >> q;
  int a[n + 1];
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  while (q--) {
    scanf("%d%d", &x, &y);
    y = a[y];
    if (x == 1) {
      int sz = pq.size();
      if (sz < k) {
        pq.push(y);
        st.insert(y);
      } else if (pq.top() < y) {
        st.erase(pq.top());
        pq.pop();
        pq.push(y);
        st.insert(y);
      }
    } else {
      if (st.count(y) > 0) {
        printf("YES\n");
      } else {
        printf("NO\n");
      }
    }
  }
  return 0;
}
