#include <bits/stdc++.h>
using namespace std;
int t[150150], w[10];
bool sortfunction(int i, int j) { return (t[i] > t[j]); }
int main(void) {
  int n, k, q, j;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) {
    cin >> t[i];
  }
  for (int i = 0, ty, id; i < q; i++) {
    scanf("%d%d", &ty, &id);
    if (ty == 1 && t[id] > t[w[k - 1]]) {
      w[k] = id;
      sort(w, w + k + 1, sortfunction);
    } else if (ty == 2) {
      for (j = 0; j < k; j++) {
        if (w[j] == id) {
          cout << "YES" << endl;
          break;
        }
      }
      if (j == k) cout << "NO" << endl;
    }
  }
  return 0;
}
