#include <bits/stdc++.h>
using namespace std;
set<int> st;
set<int>::iterator it;
int n, m, q, x, a[200100];
int main() {
  scanf("%d %d %d", &n, &m, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < q; i++) {
    scanf("%d", &x);
    if (x == 1) {
      scanf("%d", &x);
      st.insert(a[x]);
      if (st.size() > m) st.erase(st.begin());
    } else {
      scanf("%d", &x);
      it = st.find(a[x]);
      int dist = distance(it, st.end());
      if (dist == 0 || dist > m)
        printf("NO\n");
      else
        printf("YES\n");
    }
  }
  return 0;
}
