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>
const int MAXN = 150000 + 100;
using namespace std;
int n, m, q;
int vis[MAXN];
struct Node {
  int val, id;
  bool operator<(const Node &b) const { return val > b.val; }
} node, a[MAXN];
int main() {
  priority_queue<Node> Q;
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i].val);
    a[i].id = i;
  }
  while (q--) {
    int op, x;
    scanf("%d%d", &op, &x);
    if (op == 1) {
      if (Q.size() == m) {
        Node temp = Q.top();
        vis[temp.id] = 0;
        Q.pop();
        node.val = a[x].val;
        node.id = x;
        Q.push(node);
        vis[x] = 1;
      } else {
        node.id = x;
        node.val = a[x].val;
        Q.push(node);
        vis[x] = 1;
      }
    } else {
      if (vis[x])
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
