#include <bits/stdc++.h>
using namespace std;
long long int n, k, q, t[11111111], ty[1111111], id[1111111];
set<int>::iterator it;
vector<int> v;
struct cmp {
  bool operator()(int a, int b) { return t[a] < t[b]; }
};
set<int, cmp> s;
int main() {
  cin >> n >> k >> q;
  for (int i = 1; i <= n; ++i) {
    cin >> t[i];
  }
  for (int i = 1; i <= q; ++i) {
    cin >> ty[i] >> id[i];
  }
  for (int i = 1; i <= q; ++i) {
    if (ty[i] == 1) {
      s.insert(id[i]);
      if (s.size() > k) {
        s.erase(s.begin());
      }
    } else {
      if (s.find(id[i]) == s.end()) {
        cout << "NO" << endl;
      } else {
        cout << "YES" << endl;
      }
    }
  }
  return 0;
}
