#include <bits/stdc++.h>
using namespace std;
long long n, k, Q, t, d, a[200005];
priority_queue<long long, vector<long long>, greater<long long> > q;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie();
  cin >> n >> k >> Q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  while (Q--) {
    cin >> t >> d;
    d = a[d];
    if (t == 1) {
      q.push(d);
      while (q.size() > k) q.pop();
    } else {
      vector<long long> v;
      while (!q.empty()) v.push_back(q.top()), q.pop();
      int c = 0;
      for (int i = 0; i < v.size(); i++) {
        if (v[i] == d) c = 1;
        q.push(v[i]);
      }
      if (c)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
