#include <bits/stdc++.h>
using namespace std;
const int MAXN = 15e4 + 4;
const int MAXQ = MAXN;
const int MAXK = 6 + 2;
int n, k, q;
int t[MAXN];
set<int, greater<int> > st;
int main() {
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 0; i < n; ++i) scanf("%d", t + i);
  while (q--) {
    int op, id;
    scanf("%d%d", &op, &id);
    --id;
    if (op == 1) {
      st.insert(t[id]);
    } else {
      if (!st.count(t[id])) {
        puts("NO");
        continue;
      }
      int cnt = k;
      bool ok = false;
      for (auto it : st) {
        if (it == t[id]) {
          puts("YES");
          ok = true;
          break;
        }
        --cnt;
        if (ok) break;
        if (cnt == 0) break;
      }
      if (!ok) puts("NO");
    }
  }
  return 0;
}
