import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N,X,Y = MI()
A = LI()
SA = sum(A)

P = [0]+[X-a for a in A]
SP = [0]
min_SP = [0]
s = 0
m = 0
for i in range(1,N+1):
    s += P[i]
    SP.append(s)
    m = min(m,s)
    min_SP.append(m)

Q = [0]+[Y-a for a in A[::-1]]
SQ = [0]
min_SQ = [0]
s = 0
m = 0
for i in range(1,N+1):
    s += Q[i]
    SQ.append(s)
    m = min(m,s)
    min_SQ.append(m)

r = SP[1]-min_SP[0]
R = [r]
for i in range(2,N):
    r = max(r,SP[i]-min_SP[i-1])
    R.append(r)

s = SQ[1]-min_SQ[0]
S = [s]
for i in range(2,N):
    s = max(s,SQ[i]-min_SQ[i-1])
    S.append(s)

SA = sum(A)

for i in range(N-2):
    print(SA+R[i]+S[N-3-i])