# coding: utf-8
# Your code here!


import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read

n,k,*p = [int(i) for i in read().split()]

"""
nextのテーブルを作る
Table[i][j] = j の 2**i個先
N: 要素数
MAX: 最大で何個先をみたいか
"""
def doubling_make_table(N,MAX):

    logN = len(bin(MAX))-2 #ceil(log_2(N)) 

    Table = [[-1]*N for _ in range(logN)]
    """ここを変更する"""
    Table[0] = [i+pi for i,pi in enumerate(p)]
#    for j in range(N):
#        Table[0][j] =
    #Table[1] = p[:]#[ii-1 for ii in p]
    """ここまで"""
    for i in range(1,logN):
        for j, Tiij in enumerate(Table[i-1]):
            if Tiij != -1:
                Table[i][j] = Table[i-1][Tiij%n]+(Tiij-Tiij%n)
    return Table


"""最大で何個先をみたいか：変更する"""
MAX = 10**10
BITMAX = len(bin(MAX))-2

succ = doubling_make_table(n,MAX)

"""
p の Q個先を求める
例: S^7(x) = S(S^2(S^4(x))) のように計算
"""
def getnext(p,Q):
    for k in range(BITMAX-1,-1,-1):
        if p == -1: break
        if (Q >> k) & 1: p = succ[k][p%n]+(p-p%n)
    return p

#print(len(succ),BITMAX)

for i in range(n):
    print(getnext(i,k)+1)


#print(succ[:5])