#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, x, y; cin >> n >> x >> y;
  vector<int> a(n); REP(i, n) cin >> a[i];
  vector<ll> l(n, -LINF), r(n, -LINF);
  FOR(i, 1, n - 1) l[i] = max(l[i - 1] + x - a[i - 1], 1LL * x - a[i - 1]);
  FOR(i, 1, n - 1) chmax(l[i], l[i - 1]);
  ll sum = 0;
  FOR(i, 1, n - 1) {
    sum += a[i - 1];
    l[i] += sum;
  }
  for (int i = n - 2; i > 0; --i) r[i] = max(r[i + 1] + y - a[i + 1], 1LL * y - a[i + 1]);
  for (int i = n - 2; i > 0; --i) chmax(r[i], r[i + 1]);
  sum = 0;
  for (int i = n - 2; i > 0; --i) {
    sum += a[i + 1];
    r[i] += sum;
  }
  FOR(m, 1, n - 1) cout << l[m] + a[m] + r[m] << '\n';
  return 0;
}