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 main() {
  unsigned long long n, k, q;
  cin >> n >> k >> q;
  vector<unsigned long long> v(n, 0);
  vector<unsigned long long> rating(n, 0);
  for (unsigned long long i = 0; i < n; i++) {
    cin >> rating[i];
  }
  vector<unsigned long long> sort_rating(rating);
  sort(sort_rating.begin(), sort_rating.end(), std::greater<int>());
  unsigned long long type, id;
  vector<unsigned long long> qq;
  for (unsigned long long i = 0; i < q; ++i) {
    cin >> type >> id;
    if (type == 1) {
      v[id - 1] = rating[id - 1];
      qq.push_back(rating[id - 1]);
      std::sort(qq.begin(), qq.end(), std::greater<unsigned long long>());
      if (qq.size() > k) {
        qq = vector<unsigned long long>(qq.begin(), qq.begin() + k);
      }
    } else {
      if (v[id - 1] == 0) {
        cout << "NO" << endl;
      } else {
        if (qq.size() < k) {
          cout << "YES" << endl;
        } else {
          if (qq[k - 1] > v[id - 1]) {
            cout << "NO" << endl;
          } else {
            cout << "YES" << endl;
          }
        }
      }
    }
  }
  return 0;
}
