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 gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
signed main(void) {
  long long n, k, q;
  cin >> n >> k >> q;
  vector<long long> a(n);
  for (long long i = 0; i < (n); i++) cin >> a[i];
  vector<pair<long long, long long> > v;
  while (q--) {
    long long t, id;
    cin >> t >> id;
    id--;
    if (t == 1) {
      if (v.size() < k) {
        v.push_back(pair<long long, long long>(a[id], id));
      } else {
        if (v[0].first < a[id]) v[0] = pair<long long, long long>(a[id], id);
      }
      sort(v.begin(), v.end());
    } else {
      bool c = false;
      for (long long i = 0; i < (v.size()); i++)
        if (v[i].second == id) c = true;
      if (c)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
}
