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() {
  map<long, long> t;
  long n, q;
  int k;
  map<long, long> inwin;
  map<long, long> reversinwin;
  cin >> n >> k >> q;
  long type, id;
  auto online = new bool[n];
  auto res = new string[q];
  int resi = 0;
  for (int i = 0; i < n; i++) cin >> t[i];
  for (int i = 0; i < n; i++) online[i] = false;
  for (int i = 0; i < q; i++) {
    cin >> type >> id;
    if (type == 1) {
      online[id] = true;
      if (inwin.size() < k) {
        inwin[id] = t[id - 1];
        reversinwin[t[id - 1]] = id;
      } else {
        auto q = reversinwin.begin();
        inwin.erase(q->second);
        reversinwin.erase(q->first);
        inwin.insert(make_pair(id, t[id - 1]));
        reversinwin.insert(make_pair(t[id - 1], id));
      }
    }
    if (type == 2) {
      if (online[id] && inwin.find(id) != inwin.end())
        res[resi] = "YES";
      else
        res[resi] = "NO";
      resi++;
    }
  }
  for (int i = 0; i < resi; i++) cout << res[i] << endl;
  ;
  return 0;
}
