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>
void solve() {
  int n, k, q;
  std::cin >> n >> k >> q;
  std::vector<int> t(n);
  for (int i = 0; i < n; ++i) {
    int temp;
    std::cin >> temp;
    t[i] = temp;
  }
  std::vector<int> curr_tbl(k);
  for (int i = 0, indx_tbl = 0; i < q; ++i) {
    int type;
    int id;
    std::cin >> type >> id;
    --id;
    if (type == 1) {
      if (indx_tbl < k) {
        curr_tbl[indx_tbl] = t[id];
        ++indx_tbl;
      } else {
        auto min_it = std::min_element(curr_tbl.begin(), curr_tbl.end());
        if (t[id] > *min_it) {
          *min_it = t[id];
        }
      }
    } else {
      if (std::find(curr_tbl.begin(), curr_tbl.end(), t[id]) != curr_tbl.end())
        std::cout << "YES" << std::endl;
      else
        std::cout << "NO" << std::endl;
    }
  }
}
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie();
  std::cout.tie();
  solve();
}
