#include<iostream>
#include<queue>
#include<set>
using namespace std;
const int N=4e5+6;
long long int res[N],a[N];
int n,c;
class cmp1{
	public:
	bool operator()(int i,int j){
		return c*i-a[i]>c*j-a[j];
	}
};
class cmp2{
	public:
	bool operator()(int i,int j){
		return c*i+a[i]>c*j+a[j];
	}
	
};

int main(){
	cin>>n>>c;
	cout<<N;
	for(int i=0;i<n;++i) cin>>a[i];
	multiset<int,cmp1> s1;
	multiset<int,cmp2> s2;
	
	s1.insert(0);
	for(int i=1;i<n;++i){
		for(auto it=s1.begin();it!=s1.end();++it){
			if(a[i]>=a[*it]){
				res[i]=max(res[i],a[i]-c*i+c*(*it)-a[*it]);
				break;
			}
		}
		s1.insert(i);
	}
	
	s2.insert(0);
	for(int i=1;i<n;++i){
		for(auto it=s2.begin();it!=s2.end();++it){
			if(a[i]<=a[*it]){
				res[i]=max(res[i],-a[i]-c*i+c*(*it)+a[*it]);
				break;
			}
		}	
		s2.insert(i);
	}
	for(int i=0;i<n;++i) cout<<res[i]<<" ";
	return 0;
}