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() {
  long long n, k, q, a;
  cin >> n >> k >> q;
  vector<pair<long long, long long> > w;
  pair<long long, long long> x;
  for (long long i = 0; i < n; ++i) {
    cin >> a;
    x.first = a;
    x.second = i;
    w.push_back(x);
  }
  vector<pair<long long, long long> > y;
  vector<string> u;
  x.first = -1;
  x.second = -1;
  y.push_back(x);
  for (long long i = 0; i < q; ++i) {
    cin >> a;
    if (a == 1) {
      cin >> a;
      a--;
      x.first = w[a].first;
      x.second = a;
      y.push_back(x);
    } else {
      cin >> a;
      a--;
      for (long long j = (long long)(y.size()) - 1;
           j > (long long)(y.size()) - min(k, (long long)(y.size())) - 1; --j) {
        if (y[j].second == a) {
          u.push_back("YES");
          break;
        } else if (j == (long long)(y.size()) - min(k, (long long)(y.size()))) {
          u.push_back("NO");
        }
      }
      if (y.empty() == true) u.push_back("NO");
    }
    if ((long long)y.size() > k) y.erase(y.begin());
    sort(y.begin(), y.end());
  }
  for (long long i = 0; i < (long long)(u.size()); ++i) cout << u[i] << endl;
  return 0;
}
