#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll inf=144494;
ll mod=1000000007;
ll op(ll a,ll b){
    return max(a,b);
}
ll e(){
    return -inf;
}
int main(){
    ll n,x,y;
    cin >> n >> x >> y;
    vector<ll>a(n);
    ll sum=0;
    for (ll i = 0; i < n; i++)
    {
        cin >> a[i];
        sum+=a[i];
    }
    vector<ll>b(n),c(n);
    ll now=0;
    for (ll i = 0; i < n; i++)
    {
        b[i]=x-a[i]+now;
        now=max((ll)0,b[i]);
    }
    now=0;
    for (ll i = n-1; i >=0; i--)
    {
        c[i]=y-a[i]+now;
        now=max((ll)0,c[i]);
    }
    segtree<ll,op,e>seg1(b),seg2(c);
    for (ll i = 1; i < n-1; i++)
    {
        cout << seg1.prod(0,i)+seg2.prod(i+1,n)+sum << endl;
    }
}