#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  const int M = 30;
  int n, k; cin >> n >> k;
  vector<int> p(n); REP(i, n) cin >> p[i];
  vector<vector<ll> > dp(M, vector<ll>(n));
  REP(i, n) dp[0][i] = p[i];
  REP(i, M - 1) REP(j, n) dp[i + 1][j] = dp[i][j] + dp[i][(j + dp[i][j]) % n];
  REP(i, n) {
    ll ans = 0;
    REP(j, M) if (k >> j & 1) ans += dp[j][(i + ans) % n];
    cout << i + ans + 1 << '\n';
  }
  return 0;
}