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;
template <typename X>
inline X abs(const X& a) {
  return a < 0 ? -a : a;
}
template <typename X>
inline X sqr(const X& a) {
  return a * a;
}
bool so(int i, int j) {
  if (i > j) return true;
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n, k, q, a, b;
  cin >> n >> k >> q;
  vector<int> v;
  for (int i = 0; i < n; i++) {
    cin >> b;
    v.push_back(b);
  }
  set<int> online;
  set<int> disp, notDisp;
  int c = 0, r = 0;
  for (int i = 0; i < q; i++) {
    cin >> a >> b;
    if (a == 1) {
      if (r < k) {
        online.insert(b);
        r++;
      } else {
        r = k;
        bool f = false;
        int p;
        for (set<int>::iterator it = online.begin(); it != online.end(); it++) {
          if (v[b - 1] > v[(*it) - 1]) {
            f = true;
            p = *it;
            break;
          }
        }
        if (f) {
          notDisp.insert(p);
          online.insert(b);
        }
      }
    }
    if (a == 2) {
      if (online.find(b) != online.end() && notDisp.find(b) == notDisp.end()) {
        cout << "YES" << endl;
        disp.insert(b);
      } else
        cout << "NO" << endl;
    }
  }
  return 0;
}
