#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

int main(){
    ll n,k;
    cin >> n >> k;
    vector<ll> p(n);
    rep(i,n) cin >> p[i];
    vector<vector<pll>> db(100,vector<pll>(n));
    rep(i,n) db[0][i] = {(i+p[i])%n,(i+p[i])/n};
    for(int i=1;i<=99;i++){
        rep(j,n){
            ll a = db[i-1][j].first;
            ll b = db[i-1][j].second + db[i-1][a].second;
            a = db[i-1][a].first;
            db[i][j] = pll(a,b);
        }
    }

    vector<pll> ans(n);
    rep(i,n) ans[i] = pll(i,0);
    ll c = 0;
    while(k > 0){
        if(k&1){
            rep(i,n){
                ll a = ans[i].first;
                ll b = ans[i].second + db[c][a].second;
                a = db[c][a].first;
                ans[i] = pll(a,b);
            }
        }
        k >>= 1;
        ++c;
    }
    rep(i,n){
        ll now = ans[i].first + ans[i].second * n + 1 ; 
        cout << now << endl;
    }
    return 0;
}