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;
using namespace std;
const int N = 200500;
int n, k, q;
int t[N];
int main() {
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &t[i]);
  }
  set<pair<int, int> > now;
  set<pair<int, int> >::iterator it;
  for (int o = 0; o < q; o++) {
    int type;
    scanf("%d", &type);
    if (type == 1) {
      int id;
      scanf("%d", &id);
      now.insert(make_pair(t[id], id));
    } else {
      int rem = k;
      it = now.end();
      if ((int)now.size() == 0) {
        puts("NO");
        continue;
      }
      --it;
      bool was = false;
      int id;
      scanf("%d", &id);
      for (int cur = 1; cur <= k + 1; cur++) {
        if (it->second == id) {
          was = true;
          break;
        }
        if (it == now.begin()) {
          break;
        }
        --it;
      }
      if (was)
        puts("YES");
      else
        puts("NO");
    }
  }
  return 0;
}
