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() {
  int flag = 0;
  int n, k, q;
  cin >> n >> k >> q;
  int min = INT_MAX;
  vector<pair<int, int>> t;
  int on[150000] = {0};
  int Power[150000];
  int j = 0;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    Power[i] = a;
    t.push_back({a, i});
  }
  sort(t.begin(), t.end());
  while (q--) {
    int a, b;
    cin >> a >> b;
    if (a == 1) {
      on[b - 1] = 1;
      j++;
    }
    if (a == 2) {
      if (on[b - 1] == 0) {
        cout << "NO" << endl;
      } else {
        if (j <= k)
          cout << "YES" << endl;
        else {
          if (Power[b] < min) {
            cout << "NO" << endl;
          } else {
            flag = 0;
            int col = 0;
            for (int i = n - 1; i >= 0; i--) {
              if (on[t[i].second]) {
                col++;
                if (b == (t[i].second + 1)) {
                  flag = 1;
                }
                if (col == k) {
                  min = Power[i];
                  break;
                }
              }
            }
            if (flag)
              cout << "YES" << endl;
            else
              cout << "NO" << endl;
          }
        }
      }
    }
  }
  return 0;
}
