def solve() :
    n,x,y=map(int,input().split())
    a = list(map(int, input().split()))
    inf = 1000000007
    dp1 = [-inf]*(n+1)
    dp2=[-inf]*(n+1)
    cur = -inf
    for i in range(n) : 
        cur = max(x-a[i], x-a[i]+cur)
        dp1[i+1] = max(dp1[i],cur)
    cur=-inf
    for i in range(n-1,-1,-1) :
        cur = max(y-a[i], y-a[i]+cur)
        dp2[i] = max(dp2[i+1],cur)
    sum = 0
    for i in a : sum+=i
    for i in range(n-2) :
        print(sum+dp1[i+1]+dp2[i+2])
solve()