#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
//using namespace atcoder;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
typedef vector<vector<int> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a >= b) { a = b; return 1; } return 0; }
const ll INF = 1e18+7;

#define debug(v) cout<<#v<<": ",prt(v);
template <typename A,typename B>
inline void prt(pair<A,B> p){cout<<"("<<p.first<<", "<<p.second<<")\n";}
template <typename A,typename B,typename C>
inline void prt(tuple<A,B,C> p){cout<<"("<<get<0>(p)<<", "<<get<1>(p)<<", "<<get<2>(p)<<")\n";}
inline void prt(bool p){if(p)cout<<"True"<<'\n';else cout<<"False"<<'\n';}
template <typename T> 
inline void prt(vector<T> v){cout<<'{';for(ll i=0;i<v.size();i++){cout<<v[i];if(i<v.size()-1)cout<<", ";}cout<<'}'<<'\n';}
template<typename T> 
inline void prt(vector<vector<T> >& vv){ for(const auto& v : vv){ prt(v); } }
template <typename T> 
inline void prt(deque<T> v){cout<<'{';for(ll i=0;i<v.size();i++){cout<<v[i];if(i<v.size()-1)cout<<", ";}cout<<'}'<<'\n';}
template <typename A,typename B>
inline void prt(map<A,B> v){cout<<'{';ll c=0;for(auto &p: v){cout<<p.first<<":"<<p.second;c++;if(c!=v.size())cout<<", ";}cout<<'}'<<'\n';}
template <typename A,typename B>
inline void prt(unordered_map<A,B> v){cout<<'{';ll c=0;for(auto &p: v){cout<<p.first<<":"<<p.second;c++;if(c!=v.size())cout<<", ";}cout<<'}'<<'\n';}
template <typename T> 
inline void prt(set<T> v){cout<<'{';for(auto i=v.begin();i!=v.end();i++){cout<<*i;if(i!=--v.end())cout<<", ";}cout<<'}'<<'\n';}
template <typename T> 
inline void prt(multiset<T> v){cout<<'{';for(auto i=v.begin();i!=v.end();i++){cout<<*i;if(i!=--v.end())cout<<", ";}cout<<'}'<<'\n';}

/*
方針
Mを大きくするときにその都度計算すれば良さそう

*/


int main(){
	ll n,x,y;
	cin >> n >> x >> y;
	vector<ll>a(n);
	rep(i,n)cin>>a[i];
	vector<ll>xdiff(n+1,0);
	rep(i,n){
		xdiff[i+1]=x-a[i]+xdiff[i];
	}
	vector<ll>ydiff(n+2,0);
	for(int i=n;i>=1;i--){
		ydiff[i]=y-a[i-1]+ydiff[i+1];
	}

	ll s = accumulate(a.begin(),a.end(),0);
	//cout << s << endl;
	ll xMax = -INF;
	ll yMax = -INF;
	ll xMin = 0;
	ll yMin = 0;
	vector<ll>ans(n,s);
	for(int i=2;i<=n-1;i++){
		chmax(xMax,xdiff[i-1]-xMin);
		chmin(xMin,xdiff[i-1]);
		ans[i]+=xMax;
	}
	//debug(ans);

	//debug(ydiff);
	for(int i=n-1;i>=2;i--){
		chmax(yMax,ydiff[i+1]-yMin);
		chmin(yMin,ydiff[i+1]);
		ans[i]+=yMax;
	}

	for(int i=2;i<=n-1;i++){
		cout << ans[i] << endl;
	}

	return 0;
}