#include <bits/stdc++.h>
using namespace std;
map<int, int> window;
int bears[150050];
int main() {
  int n, k, q;
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    bears[i] = t;
  }
  for (int i = 0; i < q; i++) {
    int y;
    cin >> y;
    int d;
    cin >> d;
    d--;
    if (y == 1) {
      window[bears[d]] = 1;
      if (window.size() > k) {
        window.erase(window.begin());
      }
    } else {
      if (window.count(bears[d]) == 1) {
        cout << "YES";
      } else {
        cout << "NO";
      }
      cout << endl;
    }
  }
  return 0;
}
