#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n, d;
    cin >> n >> d;
    vector<int32_t> as(n);
    as[0] = 0;
    for (auto i = 1; i < n; ++i) {
        cin >> as[i];
        as[i] += as[i - 1];
    }
    for (auto i = 1; i < n; ++i) {
        if (as[i - 1] + d <= as[i])
            continue;
        as[i] += d - (as[i] - as[i - 1]);
    }
    for (auto i = 0; i < n; ++i) {
        cout << as[i] << (i == n - 1 ? '\n' : ' ');
    }
    return 0;
}