#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;


template <typename T>
struct segtree{
    int n;
    T UNIT;
    vector<T> dat;
    T (*calc)(T, T);

    segtree(int n_, T unit, T (*_calc)(T, T)){
        UNIT = unit;
        calc = _calc;
        n = 1;
        while(n < n_) n *= 2;
        dat = vector<T>(2*n);
        for(int i = 0; i < 2*n; i++) dat[i] = UNIT;
    }

    void insert(int k, T a){
        dat[k+n-1] = a;
    }
    void update_all(){
        for(int i = n-2; i >= 0; i--){
            dat[i] = calc(dat[i*2+1], dat[i*2+2]);
        }
    }
    //k番目の値(0-indexed)をaに変更
    void update(int k, T a){
        k += n-1;
        dat[k] = a;
        while(k > 0){
            k = (k-1)/2;
            dat[k] = calc(dat[k*2+1], dat[k*2+2]);
        }
    }

    //[a, b)
    //区間[a, b]へのクエリに対してはquery(a, b+1)と呼ぶ
    T query(int a, int b, int k=0, int l=0, int r=-1){
        if(r < 0) r = n;
        if(r <= a || b <= l) return UNIT;
        if(a <= l && r <= b) return dat[k];
        else{
            T vl = query(a, b, k*2+1, l, (l+r)/2);
            T vr = query(a, b, k*2+2, (l+r)/2, r);
            return calc(vl, vr);
        }
    }
};

const ll INF = 1e15;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    ll x, y; cin >> x >> y;
    vector<ll> a(n);
    vector<ll> cumsum_a(n+1);
    auto calc_min = [](ll a, ll b){ return min(a, b); };
    auto calc_max = [](ll a, ll b){ return max(a, b); };
    segtree<ll> sgtl(n+1, INF, calc_min);
    segtree<ll> sgtr(n+1, -INF, calc_max);
    for(int i = 0; i < n; i++) cin >> a[i];
    ll sum_all = accumulate(a.begin(), a.end(), (ll)0);
    for(int i = 0; i < n; i++){
        cumsum_a[i+1] = cumsum_a[i]+x-a[i];
    }
    for(int i = 0; i < n+1; i++) sgtl.update(i, cumsum_a[i]);
    vector<ll> max_l(n+1), max_r(n+1);
    max_l[0] = x-a[0];
    for(int i = 1; i < n; i++){
        max_l[i] = max(max_l[i-1], cumsum_a[i+1]-sgtl.query(0, i+1));
    }
     for(int i = 0; i < n; i++) {
        cumsum_a[i+1] = cumsum_a[i]+y-a[i];
    }
    for(int i = 0; i < n+1; i++) sgtr.update(i, cumsum_a[i]);
    max_r[n-1] = y-a[n-1];
    for(int i = n-2; i >= 0; i--){
        max_r[i] = max(max_r[i+1], sgtr.query(i+1, n+1)-cumsum_a[i]);
    }
    for(int i = 1; i <= n-2; i++){
        // cout << max_l[i-1] << ' ' << max_r[i+1] << endl;
        cout << sum_all+max_l[i-1]+max_r[i+1] << endl;
    }
}