#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

const ll INF=1e18;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  ll X,Y;
  cin>>N>>X>>Y;
  vector<ll> A(N);
  rep(i,N) cin>>A[i];

  vector<vector<ll>> ldp(N+1,vector<ll> (3,-INF));
  vector<vector<ll>> rdp(N+1,vector<ll> (3,-INF));
  rep(t,2){
    ldp[0][0]=0;
    for(int i=0;i<N;i++){
      for(int j=0;j<=2;j++){
        ll value=ldp[i][j];
        if(value==-INF) continue;
        if(j==0){
          chmax(ldp[i+1][2],value+X);
          chmax(ldp[i+1][1],value+X);
          chmax(ldp[i+1][0],value+A[i]);
        }else if(j==1){
          chmax(ldp[i+1][2],value+max(X,A[i]));
          chmax(ldp[i+1][1],value+X);
        }else{
          chmax(ldp[i+1][2],value+A[i]);
        }
      }
    }
    swap(ldp,rdp);
    swap(X,Y);
    reverse(all(A));
  }
  reverse(all(rdp));

  for(int i=1;i<N-1;i++){
    ll ans=ldp[i][2]+rdp[i+1][2]+A[i];
    cout<<ans<<"\n";
  }

  return 0;
}