#include <bits/stdc++.h>

#define all(v) begin(v), end(v)

using namespace std;

using ll = long long;

const ll INF = 1e18;

int main(void) {
  ll n, k, x;
  cin >> n >> k >> x;

  vector<ll> a(n);
  for (int i = 0; i < n; ++i) cin >> a[i];

  vector<vector<ll>> dp(n+1, vector<ll>(2, INF));
  dp[0][0] = 0;

  for (int i = 1; i <= n; ++i) {
    dp[i][0] = min(dp[i-1][0] + a[i-1], dp[i-1][1] + a[i-1]);
    dp[i][1] = min(dp[i-1][0] + k + x, dp[i-1][1] + k);
  }

  cout << min(dp[n][0], dp[n][1]) << endl;
  return 0;
}