#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N,X,Y;cin>>N>>X>>Y;
    vector<ll> ans1(N),ans2(N);
    ll sum=0;
    
    vector<ll> A(N);
    for(int i=0;i<N;i++){
        cin>>A[i];
        sum+=A[i];
    }
    
    {
        vector<ll> S(N+1);
        for(int i=0;i<N;i++) S[i+1]=S[i]+X-A[i];
        ll ma=-INF,mi=INF;
        for(int i=0;i<N;i++){
            chmax(ma,S[i]-mi);
            ans1[i]=ma;
            chmin(mi,S[i]);
        }
    }
    {
        reverse(all(A));
        vector<ll> S(N+1);
        for(int i=0;i<N;i++) S[i+1]=S[i]+Y-A[i];
        ll ma=-INF,mi=INF;
        for(int i=0;i<N;i++){
            chmax(ma,S[i]-mi);
            ans2[i]=ma;
            chmin(mi,S[i]);
        }
        reverse(all(ans2));
    }
    
    for(int i=1;i<N-1;i++) cout<<sum+ans1[i]+ans2[i]<<"\n";
}