#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)

using namespace std;
typedef pair<llint, llint> P;

llint n, k;
llint p[100005];
P succ[30][100005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> k;
	for(int i = 0; i < n; i++) cin >> p[i], succ[0][i] = P((i+p[i])%n, p[i]);
	
	for(int i = 1; i < 30; i++){
		for(int j = 0; j < n; j++){
			succ[i][j] = P(succ[i-1][succ[i-1][j].first].first,
				succ[i-1][j].second + succ[i-1][succ[i-1][j].first].second);
		}
	}
	
	for(int i = 0; i < n; i++){
		llint pos = i, ans = 0;
		for(int j = 0; j < 30; j++){
			if(k & (1<<j)) ans += succ[j][pos].second,  pos = succ[j][pos].first;
		}
		cout << ans+i+1 << endl;
	}
	
	return 0;
}