// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;

const int LOG = 20;
int nxt1[100010][LOG], nxt2[100010][LOG];

int main() {
    ll N, K; scanf("%lld%lld", &N, &K);
    vector<int> P(N);
    for(int i=0; i<N; i++) scanf("%d", &P[i]);

    for(int i=0; i<N; i++) {
        int j = i + P[i];
        int k = (j >= N);
        if(k) j -= N;
        nxt1[i][0] = j, nxt2[i][0] = k;
    }

    for(int k=1; k<LOG; k++) {
        for(int i=0; i<N; i++) {
            nxt1[i][k] = nxt1[ nxt1[i][k-1] ][k-1];
            nxt2[i][k] = nxt2[i][k-1] + nxt2[ nxt1[i][k-1] ][k-1];
        }
    }

    for(int i=0; i<N; i++) {
        ll rem = K, c1 = i, c2 = 0;
        for(int k=LOG-1; k>=0; k--) {
            if(rem >> k & 1) {
                c2 += nxt2[c1][k];
                c1 = nxt1[c1][k];
            }
        }
        printf("%lld\n", c2 * N + c1 + 1);
    }
    return 0;
}