#include <bits/stdc++.h>
using namespace std;
int n, k, q, data[200001], op, id;
bool online[200001];
priority_queue<pair<int, int> > heap;
int main() {
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &data[i]);
  for (int i = 0; i < q; i++) {
    scanf("%d%d", &op, &id);
    if (op == 2)
      if (online[id])
        printf("YES\n");
      else
        printf("NO\n");
    if (op == 1) {
      if (heap.size() < k) {
        heap.push(make_pair(-data[id], id));
        online[id] = true;
      } else {
        int cur = -heap.top().first, id_min = heap.top().second;
        if (data[id] > cur) {
          online[id_min] = false;
          heap.pop();
          heap.push(make_pair(-data[id], id));
          online[id] = true;
        }
      }
    }
  }
}
