#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <climits>
#include <map>
#include <queue>
#include <cmath>

using namespace std;

using int64 = long long;

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

    int x = 0;
    cout << x << " ";
    for (int i=1; i<n; i++) {
        if (b[i] - x >= d) x = b[i];
        else x = (max(x,b[i])+d-1)/d*d;
        cout << x << (i!=n-1? " " : "\n");
        x++;
    }
}