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 n, k, q;
  cin >> n >> k >> q;
  vector<int> val(n, 0);
  for (int i = 0; i < n; i++) cin >> val[i];
  vector<int> a(k, 567);
  vector<bool> used(n, false);
  for (int i = 0; i < q; i++) {
    int t, id;
    cin >> t >> id;
    id--;
    if (t == 2) {
      if (!used[id])
        cout << "NO" << endl;
      else
        for (int j = 0; j < a.size(); j++) {
          if (a[j] == -val[id]) {
            cout << "YES" << endl;
            break;
          }
          if (j == a.size() - 1) cout << "NO" << endl;
        }
    } else {
      int it = lower_bound(a.begin(), a.end(), -val[id]) - a.begin();
      used[id] = true;
      for (int j = a.size() - 1; j > it; j--) {
        a[j] = a[j - 1];
      }
      if (it < k) a[it] = -val[id];
    }
  }
  return 0;
}
