#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

int main(){
  int n, k;
  cin >> n >> k;
  vector<int> p(n);
  rep(i,n) cin >> p[i];
  vector<vector<ll>> to(33, vector<ll>(n));
  for (int i = 0; i < n; i++) to[0][i] = p[i];
  for (int i = 0; i < 32; i++) {
    for (int j = 0; j < n; j++) to[i + 1][j] =  to[i][j] + to[i][(j + to[i][j]) % n];
  }

  for (int i = 0; i < n; i++) {
    ll res = i;
    for (int j = 0; j < 32; j++) {
      if (k & (1 << j)) res += to[j][res % n];
    }
    cout << res + 1 << endl;
  }
  return 0;
}