#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 998244353
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}



signed main(){
    ll n,x,y;cin>>n>>x>>y;
    vector<ll> a(n);
    cin>>a;
    ll base=0;
    for(auto &t:a) base+=t;
    vector<ll> u(n),v(n);
    {
        vector<ll> s(1,0);
        rep(i,n) s.push_back(s.back()+x-a[i]);
        ll t=-LINF,mi=0;
        for(int i=1;i<n;i++){
            chmax(t,s[i]-mi);
            u[i]=t;
            chmin(mi,s[i]);
        }
    }
    {
        reverse(ALL(a));
        vector<ll> s(1,0);
        rep(i,n) s.push_back(s.back()+y-a[i]);
        ll t=-LINF,mi=0;
        for(int i=1;i<n;i++){
            chmax(t,s[i]-mi);
            v[i]=t;
            chmin(mi,s[i]);
        }
        reverse(ALL(v));
    };
    for(int i=1;i<n-1;i++) cout<<base+u[i]+v[i]<<endl;
    return 0;
}