#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, q;
  scanf("%d %d %d", &n, &k, &q);
  vector<int> f(n);
  map<int, pair<int, pair<int, bool>>> o;
  for (int i = 0; i < n; i++) {
    scanf("%d", &f[i]);
    o[i] = {f[i], {i, true}};
  }
  int id, x;
  set<pair<int, pair<int, bool>>, greater<pair<int, pair<int, bool>>>> s;
  for (int i = 0; i < q; i++) {
    scanf("%d %d", &id, &x);
    x--;
    if (id == 1) {
      s.insert(o[x]);
    }
    if ((int)s.size() > k) {
      s.erase(*s.rbegin());
    }
    if (id == 2) {
      int c = 0;
      if (!o[x].second.second) {
        puts("NO");
        continue;
      }
      bool chk = false;
      for (auto it : s) {
        if (c == k) break;
        if (it.second.first == x) {
          chk = true;
          break;
        }
        c++;
      }
      if (chk)
        puts("YES");
      else
        puts("NO");
    }
  }
  return 0;
}
