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;
long long int id[150002];
vector<pair<long long, long long> > v;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long int n, k, q, i, x, y, j;
  cin >> n >> k >> q;
  for (i = 0; i < n; i++) {
    cin >> id[i];
  }
  for (i = 0; i < q; i++) {
    cin >> x >> y;
    if (x == 1) {
      if (v.size() < k) {
        v.push_back(make_pair(id[y - 1], y - 1));
        sort(v.begin(), v.end(), greater<pair<long long, long long> >());
      } else {
        v.push_back(make_pair(id[y - 1], y - 1));
        sort(v.begin(), v.end(), greater<pair<long long, long long> >());
        v.pop_back();
      }
    } else {
      int flag = 0;
      for (j = 0; j < v.size(); j++) {
        if (v[j].second == y - 1) {
          flag = 1;
          break;
        }
      }
      if (flag == 0)
        cout << "NO\n";
      else
        cout << "YES\n";
    }
  }
  return 0;
}
