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;
const int INF = INT_MAX;
const long long mod = 1e9 + 7;
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int n, k, q;
  cin >> n >> k >> q;
  vector<int> a(n), f(n, 0);
  for (int i = 0; i < n; i++) cin >> a[i];
  set<pair<int, int> > w;
  for (int i = 0; i < q; i++) {
    int t, x;
    cin >> t >> x;
    x--;
    if (t == 1) {
      if (w.size() + 1 <= k) {
        w.insert({a[x], x});
        f[x] = 1;
      } else {
        pair<int, int> y = (*w.begin());
        if (a[x] > y.first)
          f[y.second] = 0, f[x] = 1, w.erase(y), w.insert({a[x], x});
      }
    } else if (w.find({a[x], x}) != w.end())
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
