#include <bits/stdc++.h>
const double PI = acos(-1.0);
using namespace std;
const int MAXN = 150117;
int n, k, q, a[MAXN], tp, id, b[66];
int main() {
  scanf("%d %d %d", &n, &k, &q);
  for (int i = 0; i < n; scanf("%d", &a[i++]))
    ;
  while (q--) {
    scanf("%d %d", &tp, &id);
    id--;
    if (tp == 1) {
      b[min(n, k)] = a[id];
      sort(b, b + min(n, k) + 1);
      reverse(b, b + min(n, k) + 1);
    } else
      printf((find(b, b + min(n, k), a[id]) == (b + min(n, k))) ? "NO\n"
                                                                : "YES\n");
  }
  return 0;
}
