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 a[200007];
int main() {
  long long k, n, q, i, y, x1, x;
  map<long long, long long> m;
  vector<pair<long long, long long> > v;
  cin >> n >> k >> q;
  for (i = 1; i <= n; i++) cin >> a[i];
  while (q--) {
    cin >> x;
    if (x == 1) {
      cin >> y;
      m[y]++;
    } else if (x == 2) {
      cin >> x1;
      if (m.size() <= k) {
        if (m.find(x1) != m.end())
          cout << "YES" << endl;
        else
          cout << "NO" << endl;
      } else if (m.size() > k) {
        for (map<long long, long long>::iterator it = m.begin(); it != m.end();
             it++) {
          v.push_back(make_pair(a[it->first], it->first));
        }
        sort(v.begin(), v.end());
        m.erase(v[0].second);
        if (m.find(x1) != m.end())
          cout << "YES" << endl;
        else
          cout << "NO" << endl;
      }
    }
  }
}
