#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    ll n, x, y;
    cin >> n >> x >> y;
    ll a[n] = {};
    rep(i,n) cin >> a[i];
    ll dp[n][2];
    dp[0][0] = x - a[0];
    dp[0][1] = x - a[0];
    srep(i,1,n){
        dp[i][1] = max(x-a[i], dp[i-1][1]+x-a[i]);
        dp[i][0] = max(dp[i-1][0], dp[i][1]);
    }
    ll dp2[n][2];
    dp2[n-1][0] = y - a[n-1];
    dp2[n-1][1] = y - a[n-1];
    drep(i,n-1){
        dp2[i][1] = max(y-a[i], dp2[i+1][1]+y-a[i]);
        dp2[i][0] = max(dp2[i+1][0], dp2[i][1]);
    }
    ll sum = 0;
    rep(i,n) sum += a[i];
    srep(i,1,n-1){
        ll ans = sum + dp[i-1][0] + dp2[i+1][0];
        cout << ans << endl;
    }
    return 0;
}