#include <bits/stdc++.h>
using namespace std;
int a[150005];
int main() {
  int n, k, q;
  scanf("%d %d %d", &n, &k, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  multiset<int> t;
  for (int i = 1; i <= q; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    if (x == 1) {
      t.insert(a[y]);
      if ((int)t.size() > k) {
        t.erase(t.begin());
      }
    } else {
      auto it = t.find(a[y]);
      printf(it != t.end() ? "YES\n" : "NO\n");
    }
  }
  return 0;
}
