1 1 1
1000000000
2 1
 20 2 15
12698951 55128070 116962690 156763505 188535242 194018601 269939893 428710623 442819431 483000923 516768937 552903993 633087286 656092270 671535141 714291344 717660646 846508634 879748146 937368929
2 7
1 2
2 4
1 19
1 12
1 5
2 18
2 11
1 16
2 1
2 3
2 19
1 17
2 9
2 6
 6 3 10
62417580 78150524 410053501 582708235 630200761 760672946
2 2
1 5
1 2
1 4
2 4
2 1
2 1
1 6
2 5
2 6

NO
 NO
NO
NO
NO
NO
NO
YES
NO
NO
 NO
YES
NO
NO
YES
YES

#include <bits/stdc++.h>
using namespace std;
int n, m, tot;
int a, b, T;
long long mpow(long long x, long long y) {
  if (y == 0) return 1;
  long long res = mpow(x, y >> 1);
  res *= res;
  res %= 1000000007;
  if (y & 1) res *= x;
  return res % 1000000007;
}
typedef struct Ed {
  int a, c, nxt;
  friend int operator<(struct Ed x, struct Ed y) { return x.c > y.c; }
} E;
const double pi = 4 * atan(1);
double mabs(double x) {
  if (x < 0) return -x;
  return x;
}
int q[200000], v[200000];
priority_queue<E> hp;
int main(void) {
  scanf("%d%d%d", &n, &T, &m);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", q + i);
    v[i] = 0;
  }
  while (!hp.empty()) hp.pop();
  for (int i = 0; i < m; ++i) {
    scanf("%d%d", &a, &b);
    if (a == 1) {
      E tmp;
      tmp.a = b;
      tmp.c = q[b];
      if (hp.size() < T) {
        hp.push(tmp);
        v[b] = 1;
      } else {
        E tp = hp.top();
        if (tp.c < tmp.c) {
          v[tp.a] = 0;
          hp.pop();
          hp.push(tmp);
          v[b] = 1;
        }
      }
    }
    if (a == 2) {
      printf("%s\n", v[b] ? "YES" : "NO");
    }
  }
  return 0;
}
