#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, X, Y;
	cin >> N >> X >> Y;
	vector<int> A(N);
	REP(i, N) scanf("%d", &A[i]);
	
	auto func = [&](int X, bool isrev) {
		if (isrev) reverse(ALL(A));
		vector dp(N, vector(3, -longINF)); // [i][j] := j=1: 区間継続, j=2: 区間終了後
		dp[0][0] = 0;
		REP(i, N) {
			chmax(dp[i][2], dp[i][1]);
			if (i + 1 < N) {
				REP(j, 3) {
					if (dp[i][j] == -longINF) continue;
					chmax(dp[i + 1][j], dp[i][j] + (j == 1 ? X : A[i]));
					if (j == 0) chmax(dp[i + 1][1], dp[i][0] + X);
				}
			}
		}
		
		if (isrev) reverse(ALL(A));
		return dp;
	};
	
	auto dp1 = func(X, false);
	auto dp2 = func(Y, true);
	
	FOR(i, 1, N - 1) printf("%lld\n", dp1[i][2] + dp2[N - i - 1][2] + A[i]);
}