#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<ll> tbl(N); // [i] := 先頭から i 個の最大値
		
		ll sum = 0, dsum = 0, mn = 0, mx = -longINF;
		REP(i, N - 1) {
			dsum += X - A[i];
			sum += A[i];
			chmax(mx, dsum - mn);
			tbl[i + 1] = sum + mx;
			chmin(mn, dsum);
		}
		
		if (isrev) reverse(ALL(A));
		return tbl;
	};
	
	auto tbl1 = func(X, false);
	auto tbl2 = func(Y, true);
	
	FOR(i, 1, N - 1) printf("%lld\n", tbl1[i] + tbl2[N - i - 1] + A[i]);
}