#include <bits/stdc++.h>
using namespace std;
const long long LINF = (long long)1e18;
const int INF = (int)1e9 + 7;
const int N = (int)1e5 + 1;
set<int> s;
bool u[N + 5];
int a[2 * N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, k, q, t, x;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= q; ++i) {
    cin >> t >> x;
    if (t == 1) {
      if (s.size() == k) {
        if (*s.begin() < a[x]) {
          s.insert(a[x]);
          s.erase(s.begin());
        }
      } else
        s.insert(a[x]);
    } else {
      int r = s.size();
      s.insert(a[x]);
      if (r == s.size())
        cout << "YES" << endl;
      else {
        cout << "NO" << endl;
        s.erase(a[x]);
      }
    }
  }
  return 0;
}
