#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long a[200020];
long long m[200020] = {}, m1[200020] = {};
long long z = 0;
int main() {
	long long n, x, y;
	cin >> n >> x >> y;
	long long ans = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		ans += a[i];
	}
	m[0] = -10000000000000007;
	m1[0] = -10000000000000007;
	long long sum = 0, sum1 = 0;
	for (int i = 1; i < n - 1; i++) {
		sum += x - a[i];
		sum1 += y - a[n + 1 - i];
		m[i] = max(sum, m[i - 1]);
		m1[i] = max(sum1, m1[i - 1]);
		sum = max(sum, z);
		sum1 = max(sum1, z);
	}
	for (int i = 1; i <= n - 2; i++) {
		cout << ans + m[i] + m1[n - 1 - i] << endl;
	}
}