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 = 1500005;
int t[maxn];
vector<int> v;
int main(void) {
  int n, k, q;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &t[i]);
  }
  int num, a;
  priority_queue<int, vector<int>, less<int> > que;
  for (int i = 0; i < q; i++) {
    scanf("%d%d", &num, &a);
    if (num == 1) {
      que.push(t[a]);
    } else {
      int flag = 0, cnt = 0;
      while (cnt < k && !que.empty()) {
        int tmp = que.top();
        if (tmp == t[a]) {
          printf("YES\n");
          flag = 1;
          break;
        }
        que.pop();
        cnt++;
        v.push_back(tmp);
      }
      for (int i = 0; i < v.size(); i++) que.push(v[i]);
      v.clear();
      if (!flag) printf("NO\n");
    }
  }
}
