import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve()=
  var
    n = scan()
    x = scan()
    y = scan()
    a = newseqwith(n,scan())
    
    ax = newseqwith(n,0)
    cx = newseqwith(n,0)
    minIdxX = newseqwith(n+1,0)
    choicex = newseqwith(n,newseq[int](3))
    ay = newseqwith(n,0)
    cy = newseqwith(n,0)
    minIdxY = newseqwith(n+1,0)
    choicey = newseqwith(n,newseq[int](3))

  # i番目の要素をx,yに置き換えたときのうれしさ
  for i in 0..<n:
    ax[i] = x - a[i]
    ay[i] = y - a[i]


  # 両側からの累積和を用意
  cx[0] = ax[0]
  cy[^1] = ay[^1]

  for i in 1..<n:
    cx[i] = cx[i-1]+ax[i]
    cy[n-i-1] = cy[n-i]+ay[n-i-1]
  # 終端が必要だったので追加
  cx = @[0] & cx
  cy = cy & @[0]

  # 最小値のインデックス
  minIdxX[0]=0
  minIdxy[^1]=n
  for i in 1..n:
    if cx[minIdxX[i-1]] > cx[i]:
      minIdxX[i] = i
    else:
      minIdxX[i] = minIdxX[i-1]
  for i in countdown(n-1,0):
    if cy[minIdxY[i+1]] > cy[i]:
      minIdxY[i] = i
    else:
      minIdxY[i] = minIdxY[i+1]
  #echo a
  #echo "x"
  #echo cx
  #echo minIdxX

  #echo "y"
  #echo ay
  #echo cy
  #echo minIdxY
  #echo ""
  # choicex[i]
  # 0: [0..i-1]での最大値
  # 1: [?..i]での最大値：
  #  : 最小値のインデックスだけ保持しておけばよさそう
  # 2: [i..i]の値
  choicex[0][0] = cx[1]
  choicex[0][1] = cx[1]
  choicex[0][2] = cx[1]
  
  for m in 1..<n:
    choicex[m][1] = cx[m]-cx[minIdxX[m]]
    choicex[m][2] = cx[m]-cx[m-1]
    choicex[m][0] = max(choicex[m-1][0],max(choicex[m][1],choicex[m][2]))

  # choicey[i]
  # 0: [0..i-1]での最大値
  # 1: [?..i]での最大値：
  #  : 最小値のインデックスだけ保持しておけばよさそう
  # 2: [i..i]の値
  choicey[^1][0] = cy[^2]
  choicey[^1][1] = cy[^2]
  choicey[^1][2] = cy[^2]
  
  for m in countdown(n-2,0):
    choicey[m][1] = cy[m]-cy[minIdxY[m]]
    choicey[m][2] = cy[m]-cy[m+1]
    choicey[m][0] = max(choicey[m+1][0],max(choicey[m][1],choicey[m][2]))

  


  #echo choicex.join("\n")
  #echo ""
  #echo choicey.join("\n")

  #echo "a.sum() = ",a.sum
  var asum = a.sum
  for m in 1..<n-1:
    echo asum+choicex[m][0]+choicey[m+1][0]


    

  # 
solve()