#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 100000
#define L 60 /* L = ceil(log2(10^18)) */
int *ej[N], eo[N], pp[N], pp_[L + 1][N], ii[N + 1], tt[N], tt_[N], n; long long cc[N], bb[N], cc_[L + 1][N], k, time;
void upd(int i, int b) {
cc[i] -= b * time, bb[i] += b;
}
void append(int i, int j) {
int o = eo[i]++;
if (o >= 2 && (o & o - 1) == 0)
ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
ej[i][o] = j;
}
void dfs1(int i, int t) {
int o;
if (tt_[i] != -1)
return;
tt_[i] = t;
for (o = eo[i]; o--; ) {
int j = ej[i][o];
dfs1(j, t);
}
}
void update(int i, long long k, int x) {
int l;
for (l = L; l >= 0; l--)
if (k >= 1LL << l)
cc_[l][i] += x, k -= 1LL << l, i = pp_[l][i];
}
int qu[N * 2];
void dfs2(int p, int i, int cnt, int h_, int h0, int h1, int h2) {
int o, h;
qu[cnt++] = i;
if (tt[i] != -1)
h0 = cnt - 1;
for (h = h0; h >= h_; h--)
upd(qu[cnt - 1 - (k + cnt - (h <= h1 ? tt[qu[h1]] + h1 : tt[qu[h2]] + h2) - 1) % (cnt - h)], 1);
time++;
for (h = h0; h >= h_; h--)
upd(qu[cnt - 1 - (k + cnt - (h <= h1 ? tt[qu[h1]] + h1 : tt[qu[h2]] + h2) - 1) % (cnt - h)], -1);
for (o = eo[i]; o--; ) {
int j = ej[i][o];
if (j != p)
dfs2(i, j, cnt, h_, h0, h1, h2);
}
}
int main() {
int h, i, i_, j, t, l, cnt;
long long k_;
scanf("%d%lld", &n, &k);
for (i = 0; i < n; i++)
ej[i] = (int *) malloc(2 * sizeof *ej[i]);
for (i = 0; i < n; i++) {
scanf("%d", &pp[i]), pp[i]--;
append(pp[i], i);
}
for (i = 0; i < n; i++)
pp_[0][i] = pp[i];
for (l = 1; l <= L; l++)
for (i = 0; i < n; i++)
pp_[l][i] = pp_[l - 1][pp_[l - 1][i]];
memset(tt, -1, n * sizeof *tt), memset(tt_, -1, n * sizeof *tt_);
for (i = 0, t = 0; tt[i] == -1; i = pp[i], t++)
ii[tt[i] = t] = i, dfs1(i, t);
ii[t] = i_ = i;
for (i = 0; i < n; i++)
if (tt_[i] == -1)
tt_[i] = t;
j = i_, k_ = (k - t) % (t - tt[i_]);
while (k_--)
j = pp[j];
for (i = 0; i < n; i++)
if (tt[i] == -1)
cc[j] += n;
for (i = 0; i < n; i++)
update(i, k, 1), update(i, k - tt_[i], -1);
for (l = L; l > 0; l--)
for (i = 0; i < n; i++)
cc_[l - 1][i] += cc_[l][i], cc_[l - 1][pp_[l - 1][i]] += cc_[l][i];
for (i = 0; i < n; i++)
cc[i] += cc_[0][i];
cnt = 0;
for (h = t - 1; h > tt[i_]; h--)
qu[cnt++] = ii[h];
for (h = t; h > tt[i_]; h--)
dfs2(ii[h - 1], ii[h], cnt, cnt - (t - tt[i_]) + 1, cnt, t - tt[i_] - 1, cnt), qu[cnt++] = ii[h];
for (i = 0; i < n; i++)
upd(i, -bb[i]);
for (i = 0; i < n; i++)
printf("%lld\n", cc[i]);
return 0;
}
