#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
signed main(void) {
  long long n, k, q;
  cin >> n >> k >> q;
  vector<long long> a(n);
  for (long long i = 0; i < (n); i++) cin >> a[i];
  vector<pair<long long, long long> > v;
  while (q--) {
    long long t, id;
    cin >> t >> id;
    id--;
    if (t == 1) {
      if (v.size() < k) {
        v.push_back(pair<long long, long long>(a[id], id));
      } else {
        if (v[0].first < a[id]) v[0] = pair<long long, long long>(a[id], id);
      }
      sort(v.begin(), v.end());
    } else {
      bool c = false;
      for (long long i = 0; i < (v.size()); i++)
        if (v[i].second == id) c = true;
      if (c)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
}
