#include <bits/stdc++.h>
using namespace std;
template <typename T>
T expo(T e, T n) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = x * p;
    p = p * p;
    n >>= 1;
  }
  return x;
}
template <typename T>
T power(T e, T n, T m) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = (x * p) % m;
    p = (p * p) % m;
    n >>= 1;
  }
  return x;
}
template <typename T>
T InverseEuler(T a, T m) {
  return (a == 1 ? 1 : power(a, m - 2, m));
}
template <typename T>
T gcd(T a, T b) {
  while (a %= b ^= a ^= b ^= a)
    ;
  return b;
}
template <typename T>
T lcm(T a, T b) {
  return (a * (b / gcd(a, b)));
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
long long n, k, q;
long long t[200000];
bool hai[200000];
vector<pair<long long, long long> > v;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> q;
  for (__typeof(n) i = 1; i <= n; ++i) cin >> t[i];
  while (q--) {
    long long type, id;
    cin >> type >> id;
    if (type == 1) {
      v.push_back({t[id], id});
      sort((v).begin(), (v).end());
      reverse((v).begin(), (v).end());
      while (v.size() > k) {
        v.pop_back();
      }
    } else {
      bool f = false;
      for (auto it : v) {
        if (it.second == id) {
          f = true;
          break;
        }
      }
      if (f) {
        cout << "YES\n";
      } else
        cout << "NO\n";
    }
  }
  return 0;
}
