#include <bits/stdc++.h>
using namespace std;
long p[long(2e5)];
set<long> S;
int main() {
  long n, k, q, com, x;
  scanf("%ld%ld%ld", &n, &k, &q);
  for (long i = 1; i <= n; ++i) scanf("%ld", &p[i]);
  while (q--) {
    scanf("%ld%ld", &com, &x);
    x = p[x];
    if (com == 1) {
      if (S.size() < k)
        S.insert(x);
      else {
        long tmp = *S.begin();
        if (x < tmp)
          continue;
        else {
          S.insert(x);
          S.erase(S.begin());
        }
      }
    } else {
      if (S.count(x))
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
