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;
bool vis[200100];
int t[200100];
int low = 1e9;
int main() {
  int n, k, q, cnt = 0;
  scanf("%d %d %d", &n, &k, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", t + i);
  }
  priority_queue<int, vector<int>, greater<int> > que;
  while (q--) {
    int type, id;
    scanf("%d %d", &type, &id);
    if (type == 1) {
      cnt++;
      vis[id] = 1;
      if (que.size() >= k && que.top() < t[id]) {
        que.pop();
      }
      que.push(t[id]);
    } else {
      if (vis[id] && t[id] >= que.top()) {
        puts("YES");
      } else {
        puts("NO");
      }
    }
  }
  return 0;
}
