#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}

const char newl = '\n';

int main() {
    int n,k;
    cin >> n >> k;
    vector<int> p(n);
    vector<vector<ll>> a(32,vector<ll>(n));
    for (int i = 0;i < n;++i) cin >> p[i];
    // for (int i = 0;i < n;++i) a[0][i] = i;
    for (int i = 0;i < n;++i) a[1][i] = p[i];
    for (int i = 1;i < 31;++i) for (int j = 0;j < n;++j) {
        a[i+1][j] = a[i][j]+a[i][(j+a[i][j])%n];
    }
    vector<ll> ans(n);
    for (int i = 0;i < n;++i) ans[i] = i;
    for (int i = 1;i < 32;++i) {
        if (k&1) for (int j = 0;j < n;++j) ans[j] = ans[j]+a[i][ans[j]%n];
        k /= 2;
    }
    for (int i = 0;i < n;++i) cout << ans[i]+1 << newl;
}