#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
	int N;ll K;cin >> N >> K;
	vector<int> P(N, 0);
	for (int i = 0;i < N;i++) cin >> P[i];
	vector<vector<ll>> dp(40, vector<ll>(N, 0));
	for (int i = 0;i < N;i++) dp[0][i] = P[i];
	for (int i = 1;i < 40;i++) for (int j = 0;j < N;j++) {
		ll k = (j + dp[i - 1][j]) % N;
		dp[i][j] = dp[i - 1][j] + dp[i - 1][k];
	}
	for (int i = 0;i < N;i++) {
		ll ans = i;
		ll k = K;
		int c = 0;
		while (k != 0) {
			int m = k % 2;
			if (m == 1) {
				ans += dp[c][ans % N];	
			}
			k -= m;
			k /= 2;
			c++;
		}
		cout << ans + 1 << endl;
	}
}