#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int) (int)(x).size()
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

const char nl = '\n';

int N, K;
const int maxn = 5e5+5;
int fwd[maxn];
vector<int> bck[maxn];

bool incycle[maxn];
int cycleSize[maxn];
int ans[maxn];

int cur[maxn], vis[maxn];
vector<int> st;
vector<vector<int>> cycles;
pair<int, int> cycleIndex[maxn];
void DFS(int i) {
	if (vis[i]) return;
	vis[i] = 1;

  cur[i] = 1;
  st.push_back(i);

	if (cur[fwd[i]]) {
    int cyc = 0;
		for (int j = sz(st)-1; j >= 0; j--) {
			incycle[st[j]] = true;
      cyc++;
			if (st[j] == fwd[i]) break;
		}
    int idx = cyc - 1;
		for (int j = sz(st)-1; j >= 0; j--) {
      cycleSize[st[j]] = cyc;
      cycleIndex[st[j]] = {cycles.size(), idx--};
			if (st[j] == fwd[i]) break;
		}
    cycles.push_back(vector<int>(cyc, 0));
	}
	else {
		DFS(fwd[i]);
	}
  st.pop_back();
  cur[i] = 0;
}

struct DS {
  int sum = 0;
  deque<int> v;

  int size() {
    return v.size();
  }

  void add() {
    sum++;
    v.push_front(1);
  }

  void pop() {
    assert(!v.empty());
    sum -= v.back();
    v.pop_back();
  }
};

void merge(DS& a, DS& b) {
  if (a.size() < b.size()) swap(a, b);
  for (int i = 0; i < b.size(); i++) {
    a.v[i] += b.v[i];
    a.sum += b.v[i];
  }
}

DS* dfs(int i) {
  DS* vi = new DS();
  for (int j: bck[i]) {
    if (!incycle[j]) {
      DS* vj = dfs(j);
      merge(*vi, *vj);
    }
  }
  vi->add();
  if (vi->size() > K + 1) vi->pop();
  // cout << i << ": " << vi->sum << endl;
  // for (int j: vi->v) {
  //   cout << j << ' ';
  // }
  // cout << endl;
  ans[i] += vi->sum;
  return vi;
}

int jmp[20][maxn];
int jump(int i, int d) {
  for (int k = 19; k >= 0; k--) {
    if (d & (1 << k)) i = jmp[k][i];
  }
  return i;
}

void addRange(int i, int j, int x) {
  // cout << "adding cycle " << i << ' ' << j << ": " << x << endl;
  // [i, j]
  auto [ai, ci] = cycleIndex[i];
  auto [aj, cj] = cycleIndex[j];
  assert(ai == aj);
  if (ci <= cj) {
    cycles[ai][ci] += x;
    if (cj+1 < sz(cycles[ai])) cycles[ai][cj+1] -= x;
  }
  else {
    cycles[ai][ci] += x;
    cycles[ai][0] += x;
    if (cj+1 < sz(cycles[ai])) cycles[ai][cj+1] -= x;
  }
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N >> K;
	for (int i = 1; i <= N; i++) {
		int d; cin >> d;
		fwd[i] = d;
		jmp[0][i] = d;
		bck[d].push_back(i);
	}

	for (int k = 1; k < 20; k++) {
		for (int i = 1; i <= N; i++) {
			jmp[k][i] = jmp[k-1][jmp[k-1][i]];
		}
	}

	for (int i = 1; i <= N; i++) {
		DFS(i);
	}

	for (int i = 1; i <= N; i++) {
		if (incycle[i]) {
			DS* vi = dfs(i);

      // cout << i << ": " << cycleIndex[i].first << ' ' << cycleIndex[i].second << endl;

      int extra = (K + 1) - vi->size();
      // cout << i << ": " << vi->size() << ' ' << extra << ": " << cycleSize[i] << endl;
      if (extra >= cycleSize[i]) {
        // add vi->sum to all except i
        addRange(fwd[i], jump(fwd[i], cycleSize[i] - 2), vi->sum);
      }
      else {
        int j = jump(i, extra);
        // add vi->sum to all [fwd[i], j]
        if (extra > 0) addRange(fwd[i], j, vi->sum);

        j = fwd[j];
        while (vi->size() > 0 && j != i) {
          vi->pop();
          ans[j] += vi->sum;
          j = fwd[j];
        }
      }
		}
	}

  for (auto& v: cycles) {
    for (int i = 1; i < sz(v); i++) {
      v[i] += v[i-1];
    }
  }

  for (int i = 1; i <= N; i++) {
    if (incycle[i]) {
      auto [ai, ci] = cycleIndex[i];
      ans[i] += cycles[ai][ci];
    }
  }

	for (int i = 1; i <= N; i++) {
		cout << ans[i] << '\n';
	}

	return 0;
}