#include #define ALL(v) std::begin(v), std::end(v) #define ALLR(v) std::rbegin(v), std::rend(v) using ll = std::int64_t; using ull = std::uint64_t; using pii = std::pair; using tii = std::tuple; using pll = std::pair; using tll = std::tuple; template using vec = std::vector; template using vvec = vec>; template const T& var_min(const T &t) { return t; } template const T& var_max(const T &t) { return t; } template const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); } template const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); } template void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); } template void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); } template const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); } template void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); } template T make_v(T init) { return init; } template auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec(s, v); } template struct multi_dem_array { using type = std::array::type, Head>; }; template struct multi_dem_array { using type = std::array; }; template using mdarray = typename multi_dem_array::type; namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; } const std::size_t SIZE = 1e5 + 10; mdarray dp; int main() { ll n, k; std::cin >> n >> k; vec p(n); for (ll i = 0; i < n; i++) { std::cin >> p[i]; p[i]--; } for (ll i = 0; i < n; i++) { ll nxt = i + p[i] + 1; dp[0][i] = pll(nxt % n, nxt / n); } for (ll i = 0; i < 32 - 1; i++) { for (ll j = 0; j < n; j++) { ll a, b, c, d; std::tie(a, b) = dp[i][j]; std::tie(c, d) = dp[i][a]; dp[i + 1][j] = pll(c, b + d); } } vec ans(n); for (ll i = 0; i < n; i++) ans[i] = pll(i, 0); for (ll i = 0; k; i++, k /= 2) { if (!(k & 1)) continue; auto tmp = std::move(ans); ans.resize(n); for (ll j = 0; j < n; j++) { ll a, b, c, d; std::tie(a, b) = tmp[j]; std::tie(c, d) = dp[i][a]; ans[j] = pll(c, b + d); } } for (ll i = 0; i < n; i++) { ll a, b; std::tie(a, b) = ans[i]; std::cout << b * n + a + 1 << '\n'; } return 0; }