#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);

using namespace std;

int main(){
	int n,d;
	cin >> n >> d;
	vector<int> a(n,0);
	vector<int> dist(n,0);
	for(int i=1;i<n;i++){
		cin >> a[i];
		dist[i]+=a[i];
		dist[i]+=dist[i-1];
	}
	for(int i=1;i<n;i++){
		if((dist[i]-dist[i-1])<d){
			dist[i]=dist[i-1]+d;
		}
	}
	for(int i=0;i<n;i++){
		cout << dist[i] << " ";
	}
	cout << endl;
}