#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    int n;
    cin>>n;
    ll x,y;
    cin>>x>>y;
    ll a[n];
    rep(i,n)cin>>a[i];
    vector<ll> dp1(n+1,-inf),dp2(n+1,-inf);
    ll cur=-inf;
    rep(i,n){
        cur=max(x-a[i],x-a[i]+cur);
        dp1[i+1]=max(dp1[i],cur);
    }
    cur=-inf;
    for(int i=n-1;i>=0;--i){
        cur=max(y-a[i],y-a[i]+cur);
        dp2[i]=max(dp2[i+1],cur);
    }
    ll sum=0;
    rep(i,n)sum+=a[i];
    rep(i,n-2){
        cout<<sum+dp1[i+1]+dp2[i+2]<<endl;
    }
    return 0;
}