#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, k, x;
  cin >> n >> k >> x;
  vector<ll> a(n);
  rep(i, n) cin >> a[i];
  vector dp(n + 1, vector<ll>(2, 1e18));
  dp[0] = { 0, x };
  rep(i, n) {
    dp[i + 1][0] = min(dp[i][0] + a[i], dp[i][1] + a[i]);
    dp[i + 1][1] = min(dp[i][0] + x + k, dp[i][1] + k);
  }
  cout << min(dp[n][0], dp[n][1]) << '\n';
  return 0;
}