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>
int main(int argc, char *argv[]) {
  int n, q, k;
  std::vector<int> t;
  std::cin >> n >> k >> q;
  t.resize(n, 0);
  for (int i = 0; i < n; ++i) {
    int tmp;
    std::cin >> tmp;
    t[i] = tmp;
  }
  std::vector<std::pair<int, int>> best;
  for (int i = 0; i < q; ++i) {
    int type, id;
    std::cin >> type >> id;
    if (type == 1) {
      best.push_back(std::make_pair(t[id - 1], id));
      std::sort(best.begin(), best.end(),
                [](std::pair<int, int> const &p1, std::pair<int, int> const &p2)
                    -> bool { return p1.first > p2.first; });
      if (best.size() > k) best.pop_back();
    } else {
      bool b = false;
      for (auto const &p : best) {
        if (p.second == id) {
          b = true;
          break;
        }
      }
      if (b)
        std::cout << "YES" << std::endl;
      else
        std::cout << "NO" << std::endl;
    }
  }
}
