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

const int MAX_LOG=30;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N,K; cin >> N >> K;
    vector<int> P(N);
    for (int i=0;i<N;++i) cin >> P[i];
    vector<vector<pair<ll,ll>>> doubling(MAX_LOG,vector<pair<ll,ll>>(N));
    for (int i=0;i<N;++i) doubling[0][i]={(i+P[i])%N,(i+P[i])/N};
    for (int j=0;j<MAX_LOG-1;++j)
        for (int i=0;i<N;++i)
            doubling[j+1][i]={doubling[j][doubling[j][i].first].first,doubling[j][i].second+doubling[j][doubling[j][i].first].second};
    for (int i=0;i<N;++i){
        ll now=i,cnt=0;
        for (int j=0;j<MAX_LOG;++j) if (K&1<<j){
            cnt+=doubling[j][now].second;
            now=doubling[j][now].first;
        }
        cout << now+1+cnt*N << '\n';
    }
}