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 MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int MAXN = 15e4 + 5;
int n, k, q;
pair<int, int> p[MAXN];
priority_queue<pair<int, int>, std::vector<pair<int, int> >,
               greater<pair<int, int> > >
    pq;
int main(int argc, char const *argv[]) {
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; ++i) {
    int x;
    scanf("%d", &x);
    p[i] = make_pair(x, i);
  }
  while (q--) {
    int x, y;
    scanf("%d%d", &x, &y);
    if (x == 1) {
      pq.push(p[y]);
      if (pq.size() > k) pq.pop();
    } else {
      priority_queue<pair<int, int>, std::vector<pair<int, int> >,
                     greater<pair<int, int> > >
          tmp = pq;
      bool flag = false;
      while (!tmp.empty()) {
        if (tmp.top().second == y) {
          flag = true;
          break;
        }
        tmp.pop();
      }
      if (!flag)
        printf("NO\n");
      else
        printf("YES\n");
    }
  }
  return 0;
}
