#include <bits/stdc++.h>
using namespace std;
const int N = 200000;
const int mod = 1e9 + 7;
int n, k, m;
int t[N];
int type, id;
set<int> q;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k >> m;
  for (int i = 1; i <= (int)n; ++i) cin >> t[i];
  for (int i = 1; i <= (int)m; ++i) {
    cin >> type >> id;
    if (type == 1) {
      q.insert(-t[id]);
      if (q.size() > k) q.erase(*q.rbegin());
    } else {
      if (q.find(-t[id]) != q.end())
        cout << "YES\n";
      else
        cout << "NO\n";
    }
  }
  return 0;
}
