n,x,y = map(int,input().split())
A = list(map(int,input().split()))

dpl = [0]*n
dplf = [0]*n

now = 0
for i in range(n):
    dpl[i] = max(dpl[i-1]+x,now+x)
    dplf[i] = max(dplf[i-1]+A[i],dpl[i])
    now += A[i]
    dplf[0] = dpl[0]

dpr = [0]*(n+1)
dprf = [0]*(n+1)
now = 0
for i in range(n)[::-1]:
    dpr[i] = max(dpr[i+1]+y,now+y)
    dprf[i] = max(dprf[i+1]+A[i],dpr[i])
    now += A[i]
    dprf[-2] = dpr[-2]

for i in range(1,n-1):
    print(dplf[i-1]+A[i]+dprf[i+1])