#include using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair; using pil = pair; using pli = pair; using pll = pair; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; int main(){ int N; ll X, Y; cin >> N >> X >> Y; vector a(N); rep(i, N) cin >> a[i]; vector s(N+1, 0); rep(i, N) s[i+1] = s[i]+a[i]; vector dp1(N+1, -INF), dp2(N+1, -INF); rep(i, N){ dp2[i+1] = a[i]+max(dp1[i], dp2[i]); dp1[i+1] = X+max(dp1[i], s[i]); } vector dp3(N+1, -INF), dp4(N+1, -INF); rep3(i, N-1, 0){ dp4[i] = a[i]+max(dp3[i+1], dp4[i+1]); dp3[i] = Y+max(dp3[i+1], s[N]-s[i+1]); } rep2(i, 1, N-2){ cout << max(dp1[i], dp2[i])+a[i]+max(dp3[i+1], dp4[i+1]) << '\n'; } }