#include <bits/stdc++.h>
using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using P = pair<ll, ll>;
using P3 = pair<double,P>;
using PP = pair<P, P>;
constexpr int INF = 1 << 30;
constexpr ll MOD = ll(1e9)+7;
constexpr int di[] = {0, 1, 0, -1};
constexpr int dj[] = {1, 0, -1, 0};
constexpr double EPS = 1e-9;

int main(){
    int N, K;
    cin >> N >> K;
    vector<int> p(N);
    for(int i=0;i<N;i++){
        cin >> p[i];
    }
    vector<vector<P> > dp(31, vector<P>(N));  // dp[k][i] マスiから2**k回移動したときの(マスのindex,移動数)
    for(int i=0;i<N;i++){
        dp[0][i] = P((i+p[i])%N, p[i]);
    }
    for(int k=0;k<30;k++){
        for(int i=0;i<N;i++){
            ll idx = dp[k][i].first, cnt = dp[k][i].second;
            dp[k+1][i] = P(dp[k][idx].first, dp[k][idx].second+cnt);
        }
    }
    for(int i=0;i<N;i++){
        ll ans = i+1;
        int now = i;
        for(int k=0;k<=30;k++){
            if((K>>k)&1){
                ans += dp[k][now].second;
                now = dp[k][now].first;
            }
        }
        cout << ans << endl;
    }
    return 0;
}