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;
map<int, int> p, o;
int main() {
  long long n, k, q, ch, f, mm1 = 9999999999999999, mm2 = 9999999999999999, m1,
                            m2;
  cin >> n >> k >> q;
  int arr[n];
  for (int i = 0; i < n; i++) cin >> arr[i];
  for (int i = 0; i < q; i++) {
    cin >> ch >> f;
    if (ch == 1) {
      o[f] = 1;
      int h = arr[f - 1];
      if (h < mm1) {
        mm2 = mm1;
        mm1 = h;
        m1 = f;
        m2 = f;
      } else if (h < mm2) {
        mm2 = h;
        m2 = f;
      }
      if (k) {
        k--;
        p[f] = 1;
      } else {
        if (arr[f - 1] > mm1) {
          p[m1] = 0;
          p[f] = 1;
          mm1 = mm2;
          m1 = m2;
          mm2 = 9999999999999999;
        }
      }
    } else {
      if (o[f] && p[f])
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
