import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [[(-1, 0), (1, 0)], [(0, -1), (0, 1)]]
inf = 10**16
# md = 998244353
md = 10**9+7

n,x,y=MI()
aa=LI()

def todd(aa,x):
    cs = [0]
    for a in aa: cs.append(cs[-1]+a)
    dd=[-1]*n
    mn=inf
    mx=-inf
    for i,s in enumerate(cs[:-1]):
        cur=x*i-cs[i]
        if cur-mn>mx:mx=cur-mn
        dd[i]=mx
        mn=min(mn,cur)
    return dd

s=sum(aa)
dd0=todd(aa,x)
dd1=todd(aa[::-1],y)
# print(dd0)
# print(dd1)
for i in range(1,n-1):
    j=n-i-1
    print(s+dd0[i]+dd1[j])