n,x,y = map(int,input().split())
*a, = map(int,input().split())

dp1 = [0]*n
dp1f = [0]*n
dp2 = [0]*(n+1)
dp2f = [0]*(n+1)

v = 0
for i in range(n):
    dp1[i] = max(dp1[i-1]+x,v+x)
    dp1f[i] = max(dp1f[i-1]+a[i], dp1[i])
    dp1f[0] = dp1[0]
    v += a[i]

v = 0
for i in range(n)[::-1]:
    dp2[i] = max(dp2[i+1]+y,v+y)
    dp2f[i] = max(dp2f[i+1]+a[i], dp2[i])
    dp2f[n-1] = dp2[n-1]
    v += a[i]

for m in range(1,n-1):
    print(dp1f[m-1]+a[m]+dp2f[m+1])