#include <bits/stdc++.h>
using namespace std;
long long zero = 0;
long long one = 1;
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); }
long long expo(long long x, long long y) {
  long long res = 1;
  x = x % 1000000007;
  while (y > 0) {
    if (y & 1) res = (1ll * res * x) % 1000000007;
    y = y >> 1;
    x = (1ll * x * x) % 1000000007;
  }
  return res;
}
long long ncr(long long n, long long r) {
  long long res = 1;
  if (r > n - r) r = n - r;
  for (long long i = 0; i < r; i++) {
    res *= n - i;
    res /= i + 1;
  }
  return res;
}
long long max(long long a, long long b) { return (a > b) ? a : b; }
bool prime(long long n) {
  long long i;
  for (i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return false;
  }
  return true;
}
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.second < b.second);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, k, q;
  cin >> n >> k >> q;
  vector<long long> v(n);
  map<long long, long long> m;
  vector<pair<long long, long long> > vp;
  for (long long i = 0; i < (long long)n; i++) cin >> v[i];
  long long counter = 0;
  for (long long i = 0; i < (long long)q; i++) {
    long long x, y;
    cin >> x >> y;
    if (x == 1) {
      m[y] = v[y - 1];
      vp.push_back(make_pair(y, v[y - 1]));
      if (counter < k) {
        counter++;
      } else {
        sort(vp.begin(), vp.end(), sortbysec);
        cout << endl;
        auto it = vp.begin();
        m[it->first] = 0;
        vp.erase(it);
      }
    } else {
      if (m[y] != 0)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
}
