#line 1 "a.cpp" #define PROBLEM "" #line 2 "/home/kuhaku/atcoder/github/algo/lib/template/template.hpp" #pragma GCC target("sse4.2,avx2,bmi2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include template bool chmax(T &a, const U &b) { return a < (T)b ? a = (T)b, true : false; } template bool chmin(T &a, const U &b) { return (T)b < a ? a = (T)b, true : false; } constexpr std::int64_t INF = 1000000000000000003; constexpr int Inf = 1000000003; constexpr int MOD = 1000000007; constexpr int MOD_N = 998244353; constexpr double EPS = 1e-7; constexpr double PI = M_PI; #line 2 "/home/kuhaku/atcoder/github/algo/lib/algorithm/doubling.hpp" /** * @brief ダブリング * * @tparam L * @tparam Monoid モノイド */ template struct Doubling { private: using T = Monoid::value_type; public: Doubling(int n) : _size(n), table(L, std::vector(n)), data(L, std::vector(n)) {} template Doubling(const std::vector &to, const std::vector &v) : Doubling(to.size()) { build(to, v); } template void build(const std::vector &to, const std::vector &v) { assert(to.size() == v.size()); for (int i = 0; i < _size; ++i) { assert(-1 <= to[i] && to[i] < _size); table[0][i] = to[i]; data[0][i] = v[i]; } for (int i = 0; i < L - 1; ++i) { for (int j = 0; j < _size; ++j) { int k = table[i][j]; if (k != -1) { table[i + 1][j] = table[i][k]; data[i + 1][j] = Monoid::op(data[i][j], data[i][k]); } else { table[i + 1][j] = table[i][j]; data[i + 1][j] = data[i][j]; } } } } std::pair solve(int f, std::uint64_t k) { T res = Monoid::id; for (int cnt = 0; k > 0; k >>= 1, ++cnt) { if (k & 1) { res = Monoid::op(res, data[cnt][f]); f = table[cnt][f]; } } return std::make_pair(f, res); } private: int _size; std::vector> table; std::vector> data; }; /** * @brief ダブリング * * @tparam L */ template struct Doubling { Doubling(int n) : _size(n), data(L, std::vector(n)) {} Doubling(const std::vector &v) : Doubling(v.size()) { build(v); } void build(const std::vector &v) { for (int i = 0; i < _size; ++i) { assert(-1 <= v[i] && v[i] < _size); data[0][i] = v[i]; } for (int i = 0; i < L - 1; ++i) { for (int j = 0; j < _size; ++j) { if (data[i][j] != -1) data[i + 1][j] = data[i][data[i][j]]; } } } int solve(int f, std::int64_t k) { for (int cnt = 0; k > 0; k >>= 1, ++cnt) { if (k & 1) f = data[cnt][f]; } return f; } private: int _size; std::vector> data; }; #line 3 "/home/kuhaku/atcoder/github/algo/lib/template/macro.hpp" #define FOR(i, m, n) for (int i = (m); i < int(n); ++i) #define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i) #define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i) #define rep(i, n) FOR (i, 0, n) #define repn(i, n) FOR (i, 1, n + 1) #define repr(i, n) FORR (i, n, 0) #define repnr(i, n) FORR (i, n + 1, 1) #define all(s) (s).begin(), (s).end() #line 3 "/home/kuhaku/atcoder/github/algo/lib/template/sonic.hpp" struct Sonic { Sonic() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); } constexpr void operator()() const {} } sonic; #line 5 "/home/kuhaku/atcoder/github/algo/lib/template/atcoder.hpp" using namespace std; using ll = std::int64_t; using ld = long double; template std::istream &operator>>(std::istream &is, std::pair &p) { return is >> p.first >> p.second; } template std::istream &operator>>(std::istream &is, std::vector &v) { for (T &i : v) is >> i; return is; } template std::ostream &operator<<(std::ostream &os, const std::pair &p) { return os << '(' << p.first << ',' << p.second << ')'; } template std::ostream &operator<<(std::ostream &os, const std::vector &v) { for (auto it = v.begin(); it != v.end(); ++it) { os << (it == v.begin() ? "" : " ") << *it; } return os; } template void co(Head &&head, Tail &&...tail) { if constexpr (sizeof...(tail) == 0) std::cout << head << '\n'; else std::cout << head << ' ', co(std::forward(tail)...); } template void ce(Head &&head, Tail &&...tail) { if constexpr (sizeof...(tail) == 0) std::cerr << head << '\n'; else std::cerr << head << ' ', ce(std::forward(tail)...); } template auto make_vector(T x, int arg, Args... args) { if constexpr (sizeof...(args) == 0) return std::vector(arg, x); else return std::vector(arg, make_vector(x, args...)); } void setp(int n) { std::cout << std::fixed << std::setprecision(n); } void Yes(bool is_correct = true) { std::cout << (is_correct ? "Yes" : "No") << '\n'; } void No(bool is_not_correct = true) { Yes(!is_not_correct); } void YES(bool is_correct = true) { std::cout << (is_correct ? "YES" : "NO") << '\n'; } void NO(bool is_not_correct = true) { YES(!is_not_correct); } void Takahashi(bool is_correct = true) { std::cout << (is_correct ? "Takahashi" : "Aoki") << '\n'; } void Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); } #line 4 "a.cpp" struct Monoid { using value_type = ll; static constexpr ll id = 0; static constexpr ll op(const ll &lhs, const ll &rhs) { return lhs + rhs; } }; int main(void) { int n, k; cin >> n >> k; vector p(n); cin >> p; vector to(n); rep (i, n) to[i] = (i + p[i]) % n; Doubling<30, Monoid> db(to, p); rep (i, n) co(i + 1 + db.solve(i, k).second); return 0; }