#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, k, q, i;
  cin >> n >> k >> q;
  long long int a[n + 100];
  for (i = 1; i <= n; i++) cin >> a[i];
  set<pair<long long int, long long int> > s;
  while (q--) {
    long long int x, y;
    cin >> x >> y;
    if (x == 1) {
      if (s.size() < k)
        s.insert(make_pair(a[y], y));
      else {
        set<pair<long long int, long long int> >::iterator itlow;
        itlow = s.begin();
        if (itlow->first < a[y]) {
          s.erase(itlow);
          s.insert(make_pair(a[y], y));
        }
      }
    } else {
      set<pair<long long int, long long int> >::iterator it;
      for (it = s.begin(); it != s.end(); ++it) {
        if (it->second == y) {
          cout << "YES" << endl;
          break;
        }
      }
      if (it == s.end()) cout << "NO" << endl;
    }
  }
  return 0;
}
