def solve():
    from heapq import heapify, heappop, heappush

    N,K,X=map(int,input().split())
    A=list(map(int,input().split()))

    inf=float("inf")
    T=[[inf, inf] for _ in range(N+1)]
    T[0][0]=0

    Q=[(0,0,0)]
    while Q:
        cost,day,mode=heappop(Q)
        if day==N:
            return cost

        if mode==0:
            if cost+X<T[day][1]:
                T[day][1]=cost+X
                heappush(Q,(cost+X,day,1))
            if cost+A[day]<T[day+1][0]:
                T[day+1][0]=cost+A[day]
                heappush(Q,(cost+A[day],day+1,0))
        else:
            if cost+K<T[day+1][1]:
                T[day+1][1]=cost+K
                heappush(Q,(cost+K,day+1,1))
            if cost<T[day][0]:
                T[day][0]=cost
                heappush(Q,(cost,day,0))

#==================================================
print(solve())