n, K = map(int, input().split())
P = list(map(int, input().split()))

nex = [[0] * n for _ in range(30)]
tot = [[0] * n for _ in range(30)]
for i, p in enumerate(P):
    nex[0][i] = (i + p) % n
    tot[0][i] = p

for i in range(1, 30):
    for j in range(n):
        nex[i][j] = nex[i - 1][nex[i - 1][j]]
        tot[i][j] = tot[i -  1][j] + tot[i - 1][nex[i - 1][j]]

ans = [i for i in range(1, n + 1)]
pos = [i for i in range(n)]
for i in range(29, -1, -1):
    if not K >> i & 1:
        continue    
    for j in range(n):
        ans[j] += tot[i][pos[j]]
        pos[j] = nex[i][pos[j]]
print(*ans, sep="\n")