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;
vector<int> v;
set<int> s;
int choice[150005];
int main() {
  std::ios::sync_with_stdio(false);
  int n, k, q, m, ma = 0;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) cin >> choice[i];
  for (int i = 0; i < q; i++) {
    cin >> m >> n;
    if (m == 1) s.insert(choice[n]);
    ma = max(ma, choice[n]);
    int sz = s.size();
    int mi = min(k, sz);
    set<int>::iterator it = s.end(), it1, it2;
    it1 = s.lower_bound(ma);
    int check = 0;
    if (m == 2 && sz == 0)
      cout << "NO\n";
    else if (m == 2) {
      int j = sz - 1;
      for (it2 = it1; j >= sz - mi; it2--, j--) {
        if (*it2 == choice[n]) {
          check = 1, cout << "YES\n";
          break;
        }
      }
      if (check == 0) cout << "NO\n";
    }
  }
  return 0;
}
