#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}


signed main(){
    int n;ll k;cin>>n>>k;

    vector<int> p(n);
    cin>>p;
    
    int LOG=34;
    vector<vector<ll>> v(n,vector<ll>(LOG,0)),w(n,vector<ll>(LOG,0));
    rep(i,n){
        if(i+p[i]>=n) v[i][0]=1;
        else v[i][0]=0;

        w[i][0]=(i+p[i])%n;
    }

    rep(j,LOG-1){
        rep(i,n){
            v[i][j+1]=v[i][j]+v[w[i][j]][j];
            w[i][j+1]=(w[w[i][j]][j]);
        }
        
    }

    rep(i,n){
        int pos=i;
        ll time=0;
        rep(j,LOG)if((k>>j)&1){
            time+=v[pos][j];
            pos=w[pos][j];
        }
        cout<<time*n+pos+1<<endl;
    }

    return 0;
}