#include <bits/stdc++.h>
using namespace std;
int n, k, q, a[int(2e5)], sz;
set<pair<int, int> > st;
int main() {
  cin >> n >> k >> q;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (int i = 0; i < q; ++i) {
    int x, y;
    cin >> x >> y;
    if (x == 1) {
      st.insert(make_pair(a[y - 1], y));
      sz++;
      if (sz > k) {
        st.erase(st.begin());
        sz--;
      }
    } else {
      if (st.find(make_pair(a[y - 1], y)) != st.end()) {
        cout << "YES\n";
      } else {
        cout << "NO\n";
      }
    }
  }
  return 0;
}
