#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(int Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(int Ti=(Ta);Ti>=(Tb);--Ti)
#define Debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
const int N=1e6+5;
int n,flg[N];
ll B,b[N],a[N],val[N],dif[N];
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>B;
	deque<ll> dq;
	ll k=1,tag=0,l=0,r=B;
	For(i,2,n-1){
		cin>>b[i];
		r=min(r,b[i]);
		if(l<=r&&r==b[i]){
			flg[i]=1,l=0,dq.clear();
			continue;
		}
		if(~k){
			while(dq.size()&&dq.back()+tag>b[i]) dq.pop_back();
			if(dq.size()&&dq.back()+tag==b[i]){
				flg[i]=1,l=0,r=b[i],dq.clear();
				continue;
			}
		}else{
			while(dq.size()&&-dq.front()+tag>b[i]) dq.pop_front();
			if(dq.size()&&-dq.front()+tag==b[i]){
				flg[i]=1,l=0,r=b[i],dq.clear();
				continue;
			}
		}
		if(l>r&&!dq.size()){
			cout<<"NO\n";return 0;
		}
		val[i]=(dq.size()?k*dq.front()+tag:l);
		tie(l,r)=make_pair(b[i]-r,b[i]-l);
		tag=b[i]-tag,k*=-1;
		if(~k) dq.push_back(b[i]-tag);
		else dq.push_front(-b[i]+tag);
	}
	ll cur=(dq.size()?k*dq.front()+tag:l);
	Dec(i,n-1,2){
		dif[i]=cur;
		if(flg[i]) cur=b[i];
		else if(cur==b[i]) cur=val[i];
		else cur=b[i]-cur;
	}
	cout<<"YES\n";
	a[2]=cur;
	For(i,3,n){
		if(max({a[i-1]+dif[i-1],a[i-1],a[i-2]})-min({a[i-1]+dif[i-1],a[i-1],a[i-2]})==b[i-1]){
			a[i]=a[i-1]+dif[i-1];
		}else{
			a[i]=a[i-1]-dif[i-1];
		}
	}
	ll mn=*min_element(a+1,a+n+1);
	For(i,1,n) cout<<a[i]-mn<<" \n"[i==n];
	return 0;
}