#include <bits/stdc++.h>
using namespace std;
int n, m, ans, t[150005];
int main() {
  int n, k, q;
  scanf("%d %d %d", &n, &k, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &t[i]);
  set<int> s;
  while (q--) {
    int x, y;
    scanf("%d %d", &x, &y);
    if (x == 1)
      s.insert(t[y]);
    else
      printf("%s\n", s.count(t[y]) ? "YES" : "NO");
    while (s.size() > k) s.erase(s.begin());
  }
  return 0;
}
