#include <bits/stdc++.h>
using namespace std;
int cnt;
int on[10];
int n, k, a[150005], q;
void add(int id) {
  for (int i = 0; i < k; i++) {
    if (a[id] > a[on[i]]) {
      for (int j = k - 1; j > i; j--) on[j] = on[j - 1];
      on[i] = id;
      break;
    }
  }
}
bool fnd(int id) {
  for (int i = 0; i < k; i++) {
    if (id == on[i]) return true;
  }
  return false;
}
int main() {
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  int x, y;
  while (q--) {
    scanf("%d %d", &x, &y);
    if (x == 1)
      add(y);
    else {
      if (fnd(y))
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
