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;
struct st {
  int id;
  int val;
  bool operator<(const st &b) const {
    return val == b.val ? id < b.id : val > b.val;
  }
};
priority_queue<st> Q;
queue<int> Qi;
int ar[150006];
bool bi[150006];
int main() {
  int a, b, c, d, e, x, y, z, n, q, k;
  while (!Q.empty()) Q.pop();
  while (!Qi.empty()) Qi.pop();
  scanf("%d %d %d", &n, &k, &q);
  for (a = 1; a <= n; a++) {
    scanf("%d", &ar[a]);
  }
  while (q--) {
    st s;
    scanf("%d %d", &x, &y);
    if (x == 1) {
      if (Q.size() < k) {
        bi[y] = true;
        s.id = y;
        s.val = ar[y];
        Q.push(s);
      } else {
        s = Q.top();
        if (ar[y] > s.val) {
          Q.pop();
          bi[s.id] = false;
          s.id = y;
          s.val = ar[y];
          Q.push(s);
          bi[y] = true;
        }
      }
    } else {
      if (bi[y])
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
