#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main(){
  ll n, x, y;
  cin >> n >> x >> y;
  vector<ll> a(n), xa(n), ya(n);
  rep(i, n){
    ll in;
    cin >> in;
    a.at(i) = in;
    xa.at(i) = x - in;
    ya.at(i) = y - in;
  }
  vector<ll> sumsl(n+1, 0);
  rep(i, n) sumsl.at(i+1) = sumsl.at(i) + a.at(i);
  vector<ll> sumsr(n+1, 0);
  rrep(i, n) sumsr.at(i) = sumsr.at(i+1) + a.at(i);

  vector<ll> xv(n), yv(n);
  vector dp(n, vector<ll>(2, -1e18));
  vector idxs(n, vector<pair<int, int>>(2));
  dp.at(0).at(0) = dp.at(0).at(1) = xa.at(0);
  idxs.front().at(0) = idxs.front().at(1) = {0, 0};
  rep2(i, 1, n-1){
    if(dp.at(i-1).at(1) + xa.at(i) > xa.at(i)){
      idxs.at(i).at(1) = {idxs.at(i-1).at(1).first, i};
    }else{
      idxs.at(i).at(1) = {i, i};
    }
    dp.at(i).at(1) = max(xa.at(i), dp.at(i-1).at(1) + xa.at(i));
    if(dp.at(i).at(1) > dp.at(i-1).at(0)){
      idxs.at(i).at(0) = idxs.at(i).at(1);
    }else{
      idxs.at(i).at(0) = idxs.at(i-1).at(0);
    }
    dp.at(i).at(0) = max(dp.at(i).at(1), dp.at(i-1).at(0));
  }

  vector dp2(n, vector<ll>(2, -1e18));
  vector idxs2(n, vector<pair<int, int>>(2));
  dp2.back().at(0) = dp2.back().at(1) = ya.back();
  idxs2.back().at(0) = idxs2.back().at(1) = {n-1, n-1};
  rrep2(i, 1, n-1){
    if(dp2.at(i+1).at(1) + ya.at(i) > ya.at(i)){
      idxs2.at(i).at(1) = {i, idxs2.at(i+1).at(1).second};
    }else{
      idxs2.at(i).at(1) = {i, i};
    }
    dp2.at(i).at(1) = max(ya.at(i), dp2.at(i+1).at(1) + ya.at(i));
    if(dp2.at(i).at(1) > dp2.at(i+1).at(0)){
      idxs2.at(i).at(0) = idxs2.at(i).at(1);
    }else{
      idxs2.at(i).at(0) = idxs2.at(i+1).at(0);
    }
    dp2.at(i).at(0) = max(dp2.at(i).at(1), dp2.at(i+1).at(0));
  }

  vector<ll> ansx(n, 0), ansy(n, 0);
  rep2(i, 1, n-1){
    ll nx, nl, nr;
    if(dp.at(i-1).at(0) < dp.at(i-1).at(1)){
      nx = dp.at(i-1).at(1);
      tie(nl, nr) = idxs.at(i-1).at(1);
    }else{
      nx = dp.at(i-1).at(0);
      tie(nl, nr) = idxs.at(i-1).at(0);
    }
    ll add = sumsl.at(i);
    ansx.at(i) = add + nx;
  }
  rrep2(i, 1, n-1){
    ansy.at(i) = sumsr.at(i+1) + max(dp2.at(i+1).at(0), dp2.at(i+1).at(1));
  }
  rep2(i, 1, n-1){
    ll ans = ansx.at(i) + ansy.at(i) + a.at(i);
    cout << ans << endl;
  }
  return 0;
}