#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, K, Q;
  while (scanf("%d", &n) == 1) {
    scanf("%d", &K), scanf("%d", &Q);
    map<int, int> mapa;
    vector<int> x(n);
    for (int i = 0; i < n; i++) {
      scanf("%d", &x[i]);
      mapa[x[i]] = i;
    }
    set<int> SET;
    for (int it = 0; it < Q; it++) {
      int type;
      scanf("%d", &type);
      if (type == 1) {
        int id;
        scanf("%d", &id);
        id--;
        SET.insert(x[id]);
        while (((int)(SET).size()) > K) SET.erase(SET.begin());
      } else {
        int id;
        scanf("%d", &id);
        id--;
        bool found = 0;
        for (auto x : SET)
          if (mapa[x] == id) {
            found = 1;
            break;
          }
        puts(found ? "YES" : "NO");
      }
    }
  }
}
