INF = 1 << 60

n, k, x = map(int, input().split())
a = list(map(int, input().split()))

dp = [[INF for _ in range(2)] for _ in range(n + 1)]
dp[0][0] = 0
for i in range(n):
  dp[i + 1][0] = min(dp[i]) + a[i]
  dp[i + 1][1] = k + min(dp[i][0] + x, dp[i][1])

print(min(dp[-1]))