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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcountll

#define INF 1e16
#define mod 1000000007

P operator*(const P& a,const P& b){
	return P(a.fi+b.fi,b.se);
}

ll N,K;
vector<ll> A;
P f[31][100010];

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin>>N>>K;
  A.resize(N);
  rep(i,N)cin>>A[i];
  rep(i,N){
  	if(i+A[i]>=N) f[0][i]=P(1,(i+A[i])%N);
  	else f[0][i]=P(0,(i+A[i])%N);
  }

  rep(k,30){
  	rep(i,N){
  		f[k+1][i]=f[k][i]*f[k][f[k][i].se];
  	}
  }

  K--;
  rep(i,N){
  	P res=f[0][i];
  	rep(k,30){
  		if((K>>k)&1){
  			res=res*f[k][res.se];
  		}
  	}
  	cout<<res.fi*N+res.se+1<<endl;
  }

  return 0;
}