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 maxn = 2e6 + 10;
struct node {
  int id;
  int val;
};
bool operator<(const node &a, const node &b) { return a.val > b.val; }
node p[maxn];
int vis[maxn];
int main() {
  int n, k, q;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &p[i].val), p[i].id = i, vis[i] = 0;
  priority_queue<node> Q;
  while (q--) {
    int opt, x;
    scanf("%d%d", &opt, &x);
    if (opt == 1) {
      Q.push(p[x]);
      vis[x] = 1;
      if (Q.size() > k) {
        vis[Q.top().id] = 0;
        Q.pop();
      }
    }
    if (opt == 2) {
      if (vis[x] == 1)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
