#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()

vector<ll> prod(vector<ll> a, vector<ll> b) {
  const int n = a.size();
  vector<ll> c(n);
  rep(i, n) {
    ll d = i + b[i];
    c[i] = b[i] + a[d % n];
  }
  return c;
}

// f(i, K)
vector<ll> power(vector<ll> a, int b) {
  const int n = a.size();
  vector<ll> res(n);
  while (b > 0) {
    if (b & 1) {
      res = prod(res, a);
    }
    a = prod(a, a);
    b >>= 1;
  }
  return res;
}

int main() {
  int N, K; cin >> N >> K;
  vector<ll> P(N);
  rep(i, N) cin >> P[i];
  P = power(P, K);
  rep(i, N) cout << P[i] + i + 1 << '\n';
}