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 comp(pair<int, int> a, pair<int, int> b) { return a.first > b.first; }
pair<int, int> dis[7];
int x[200005], mark[200005] = {0};
;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k, q;
  cin >> n >> k >> q;
  int i, t;
  for (i = 0; i < n; i++) {
    cin >> t;
    x[i + 1] = t;
  }
  int ma = 0;
  while (q--) {
    int a, b, j;
    cin >> a >> b;
    if (a == 1) {
      if (ma < k) {
        dis[ma].first = x[b];
        dis[ma].second = b;
        ma++;
        sort(dis, dis + ma, comp);
        continue;
      }
      for (i = 0; i < k; i++) {
        if (x[b] > dis[i].first) {
          mark[dis[k - 1].second] = 0;
          for (j = i + 1; j < k; j++) {
            dis[j].second = dis[j - 1].second;
            dis[j].first = dis[j - 1].first;
          }
          dis[i].first = x[b];
          dis[i].second = b;
          mark[b] = 1;
          break;
        }
      }
    } else {
      for (i = 0; i < ma; i++)
        if (dis[i].second == b) {
          cout << "YES\n";
          break;
        }
      if (i == ma) cout << "NO\n";
    }
  }
}
