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;
int ar[1000009];
vector<pair<int, int> > vec;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int i, j, k, l, n, m, cnt = 0, flag = 0, beg, end, ans, temp, q, K;
  cin >> n >> m >> q;
  for (i = 1; i <= n; i++) {
    cin >> ar[i];
  }
  for (i = 1; i <= q; i++) {
    cin >> j >> k;
    if (j == 1) {
      K = vec.size();
      if (K == m) {
        if (vec[0].first < ar[k]) vec[0] = make_pair(ar[k], k);
      } else
        vec.push_back(make_pair(ar[k], k));
      sort(vec.begin(), vec.end());
    } else {
      K = vec.size();
      flag = 0;
      for (l = 0; l < K; l++)
        if (vec[l].second == k) flag = 1;
      if (flag)
        cout << "YES\n";
      else
        cout << "NO\n";
    }
  }
}
