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;
class node {
 public:
  int id, fri;
  node(int x, int y) {
    id = x;
    fri = y;
  }
  friend bool operator<(const node &x, const node &y) { return x.fri > y.fri; }
};
int a[150000 + 50];
priority_queue<node> pq;
bool show[150000 + 50];
int main() {
  memset(a, 0, sizeof a);
  memset(show, false, sizeof show);
  int n, k, q;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < q; i++) {
    int con, dd;
    scanf("%d %d", &con, &dd);
    if (con == 1) {
      node t(dd, a[dd]);
      if (pq.size() < k)
        pq.push(t), show[dd] = true;
      else if (pq.top().fri < a[dd])
        show[pq.top().id] = false, show[dd] = true, pq.pop(), pq.push(t);
    } else {
      if (show[dd])
        puts("Yes");
      else
        puts("No");
    }
  }
  return 0;
}
