// too slow solution O(n^2)

#include <iostream>
#include <set>
#include <vector>

using namespace std;
using ll = long long;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    ll c;
    cin >> c;
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        ll m = 0;
        for (int j = 0; j <= i; j++) {
            m = max(m,abs(v[i]-v[j])-c*(i-j));
        }
        cout << m << " ";
    }
    cout << "\n";
}