#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
const int MAXN = 1e5 + 10;
int n, k, a[MAXN], ans[MAXN];
int inter(int A, int B, int C, int D) {
  return max(0, min(B, D) - max(A, C) + 1);
}
void solve() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i], --a[i];
  for (int i = 0; i < n; i++) {
    int R = min(n - 1, i + k);
    int L = max(0, i - k);
    if (~a[i]) {
      int R1 = min(n - 1, a[i] + k);
      int L1 = max(0, a[i] - k);
      ans[i] = R - L + 1 + ans[a[i]] - inter(L1, R1, L, R);
    } else {
      ans[i] = R - L + 1;
    }
  }
  for (int i = 0; i < n; i++) cout << ans[i] << " ";
  cout << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int te = 1;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
