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

typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector<vector<ll>> Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() { printf("yes\n"); }
void no() { printf("no\n"); }
void Yes() { printf("Yes\n"); }
void No() { printf("No\n"); }
void YES() { printf("YES\n"); }
void NO() { printf("NO\n"); }

int n, d, a[int(1e5 + 5)], ans[int(1e5 + 5)];

int main() {
  cin >> n >> d;
  for (int i = 2; i <= n; i++) {
    cin >> a[i];
    ans[i] = ans[i - 1] + a[i];
  }

  for (int i = 2; i <= n; i++) {
    if (ans[i] - ans[i - 1] >= d) {
      continue;
    } else {
      ans[i] = ans[i - 1] + d;
    }
  }
  for (int i = 1; i <= n; i++) {
    cout << ans[i] << (i == n ? '\n' : ' ');
  }

  return 0;
}