#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n, d;
    cin >> n >> d;
    int a[n] = {};
    srep(i,1,n){
        cin >> a[i];
        a[i] = a[i-1] + a[i];
    }
    srep(i,1,n){
        a[i] = max(a[i-1] + d, a[i]);
    }
    rep(i,n){
        cout << a[i];
        if(i == n - 1)cout << endl;
        else cout << ' ';
    }
    return 0;
}