#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); }
bool des(int i, int j) { return i > j; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, q, k, r[7], typ, id;
  static int t[150001];
  static char s[150001];
  cin >> n >> k >> q;
  for (int i = 1; i <= int(n); i++) cin >> t[i];
  for (int i = 1; i <= int(n); i++) {
    s[i] = 'n';
  }
  for (int i = 1; i <= int(k); i++) r[i] = 0;
  for (int i = 1; i <= int(q); i++) {
    cin >> typ >> id;
    if (typ == 1) {
      s[id] = 'y';
      if (t[id] > r[1]) {
        r[1] = t[id];
        sort(r + 1, r + k + 1);
      }
    }
    if (typ == 2)
      cout << (binary_search(r + 1, r + k + 1, t[id]) ? "YES" : "NO") << endl;
  }
}
