#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
} 

int main(){
    ll n,x,y;cin >> n >> x >> y;
    vector<ll> v(n);rep(i,n)cin >> v[i];
    vvl dp(n+1,vl(3));dp[0][2]=-INF;
    rep(i,n){
        chmax(dp[i+1][0],dp[i][0]+v[i]);
        chmax(dp[i+1][1],dp[i][1]+x);
        chmax(dp[i+1][1],dp[i][0]+x);
        chmax(dp[i+1][2],dp[i][1]+x);
        chmax(dp[i+1][2],dp[i][2]+v[i]);
        chmax(dp[i+1][2],dp[i+1][1]);
    }
    vvl ep(n+1,vl(3));ep[n][2]=-INF;
    per(i,n){
        chmax(ep[i][0],ep[i+1][0]+v[i]);
        chmax(ep[i][1],ep[i+1][1]+y);
        chmax(ep[i][1],ep[i+1][0]+y);
        chmax(ep[i][2],ep[i+1][1]+y);
        chmax(ep[i][2],ep[i+1][2]+v[i]);
        chmax(ep[i][2],ep[i][1]);
    }
    rep(i,n+1){
        //rep(j,3)cout << ep[i][j] <<" ";cout <<endl;
    }
    rep(i,n+1){
        //cout <<dp[i][2] <<" "<<ep[i][2] <<endl;
    }
    for(int i=1;i<n-1;i++){
        cout << dp[i][2]+ep[i+1][2]+v[i] <<endl;
        //cout << dp[i][2] <<" " << ep[i+1][2] << " " << v[i] <<endl;
    }
}