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>
int a[150000], pp[150002] = {0}, vv[150002], n;
using namespace std;
void shift_up(int pos) {
  int x;
  if (pos == 1) return;
  if (vv[a[pos / 2]] > vv[a[pos]]) {
    x = a[pos / 2];
    a[pos / 2] = a[pos];
    a[pos] = x;
    shift_up(pos / 2);
  }
}
void shift_down(int pos) {
  int pos2;
  pos2 = pos;
  if (pos * 2 > n) return;
  if (vv[a[pos * 2]] < vv[a[pos2]]) {
    pos2 = pos * 2;
  }
  if ((pos * 2 + 1 <= n) && (vv[a[pos * 2 + 1]] < vv[a[pos2]]))
    pos2 = pos * 2 + 1;
  if (pos == pos2) {
    return;
  }
  int x;
  x = a[pos];
  a[pos] = a[pos2];
  a[pos2] = x;
  shift_down(pos2);
}
int main() {
  int nn, k, q, id, v;
  n = 0;
  cin >> nn >> k >> q;
  for (int i = 1; i <= nn; i++) {
    scanf("%d", &vv[i]);
  }
  for (int i = 0; i <= q; i++) {
    cin >> id >> v;
    if (id == 1) {
      if (n == k) {
        if (vv[a[1]] < vv[v]) {
          pp[a[1]] = 0;
          a[1] = v;
          pp[v] = 1;
          shift_down(1);
        }
      } else {
        if (n < k) {
          pp[v] = 1;
          n++;
          a[n] = v;
          shift_up(n);
        }
      }
    }
    if (id == 2)
      if (pp[v] == 0)
        printf("NO\n");
      else
        printf("YES\n");
  }
}
