#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.14159265358979323846;
const long double eps = 1e-16;
const unsigned long long mod = 1e9 + 7;
int main() {
  int n, k, q;
  priority_queue<int> fr;
  cin >> n >> k >> q;
  vector<int> t(n, 0);
  vector<int> tmp;
  for (int i = 0; i < n; ++i) cin >> t[i];
  for (int i = 0; i < q; ++i) {
    int type, id;
    cin >> type >> id;
    if (type == 1) {
      fr.push(t[id - 1]);
    } else if (type == 2) {
      bool ans = 0;
      while (!ans && tmp.size() < k && !fr.empty()) {
        tmp.push_back(fr.top());
        fr.pop();
        if (tmp.back() == t[id - 1]) {
          ans = 1;
        }
      }
      if (ans) {
        cout << "YES\n";
      } else {
        cout << "NO\n";
      }
      while (!tmp.empty()) {
        fr.push(tmp[tmp.size() - 1]);
        tmp.pop_back();
      }
    }
  }
  return 0;
}
