#include <bits/stdc++.h>
using namespace std;
set<long long> s;
long long a[1500003];
int main() {
  long long n, c, b, k, q, l, id;
  cin >> n >> k >> q;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (long long j = 1; j <= q; j++) {
    cin >> l >> id;
    if (l == 1) {
      s.insert(a[id]);
      while (s.size() > k) {
        s.erase(s.begin());
      }
    } else {
      if (s.find(a[id]) != s.end()) {
        printf("YES");
      } else {
        printf("NO");
      }
      cout << "\n";
    }
  }
  return 0;
}
