#include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
using namespace std;
int t[200200];
set<pair<int, int> > st;
signed main() {
  cin.tie(0);
  cout.tie(0);
  cin.sync_with_stdio(0);
  cout.sync_with_stdio(0);
  int n, k, q;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) cin >> t[i];
  for (int i = 0; i < q; i++) {
    int c, x;
    cin >> c >> x;
    if (c == 1) {
      st.insert({t[x], x});
      if (st.size() > k) {
        st.erase(*st.begin());
      }
    } else {
      if (st.find(make_pair(t[x], x)) != st.end())
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
