#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
} fio;

signed main(){
	cout<<fixed<<setprecision(10);
	
	int N, K;
	vector<int> P;
	vector<vector<int>> db;
	vector<vector<int>> in;
	
	cin>>N>>K;
	
	P.resize(N);
	db.resize(34,vector<int>(N));
	in.resize(34,vector<int>(N));
	
	for(int i = 0; i < N; i++){
		cin>>P[i];
		db[0][i] = P[i];
		in[0][i] = (P[i] + i) % N;
	}
	
	for(int i = 1; i < db.size(); i++){
		for(int j = 0; j < N; j++){
			db[i][j] = db[i-1][in[i-1][j]] + db[i-1][j];
			in[i][j] = (db[i][j] + j) % N;
		}
	}			
	
	for(int i = 0; i < N; i++){
		int sum = i+1, now = i;
		
		for(int i = 0; i < db.size(); i++){
			if((1ll<<i)&K) {
				int temp = db[i][now%N];
				now = in[i][now];
				sum += temp;
				// now = temp % N;
			}
		}
		
		cout<<sum<<endl;
	}
	
	return 0;
}