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;
const int MOD = 1e9 + 7;
const int MAXN = 2 * 1e5 + 10;
void add(long long &x, long long y) {
  x += y;
  x %= MOD;
}
bool vis[MAXN];
int a[MAXN];
struct Node {
  int index, v;
  friend bool operator<(Node a, Node b) { return a.v > b.v; }
};
int main() {
  int n, q, k;
  while (scanf("%d%d%d", &n, &k, &q) != EOF) {
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      vis[i] = false;
    }
    priority_queue<Node> Q;
    Node now;
    while (q--) {
      int op, id;
      scanf("%d%d", &op, &id);
      if (op == 1) {
        now.index = id;
        now.v = a[id];
        Q.push(now);
        vis[id] = true;
        if (Q.size() > k) {
          now = Q.top();
          Q.pop();
          vis[now.index] = false;
        }
      } else {
        printf(vis[id] ? "YES\n" : "NO\n");
      }
    }
  }
  return 0;
}
