#include <bits/stdc++.h>
using namespace std;
int n, k, q, i, j, a[150005];
set<int> s;
int main() {
  cin >> n >> k >> q;
  for (i = 1; i <= n; i++) cin >> a[i];
  while (q--) {
    cin >> i >> j;
    if (i == 2) {
      if (s.count(a[j]))
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    } else {
      s.insert(a[j]);
      if (s.size() > k) s.erase(s.begin());
    }
  }
  return 0;
}
