#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;

typedef long long ll;
//typedef modint1000000007 mint;
const int MOD = 1000000007;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1 << 30;
const ll INF = 1LL << 60;
const int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
const int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
template <class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

int main(){
    int n, k, x;
    cin >> n >> k >> x;
    vector<int> a(n);
    rep(i, n) cin >> a[i];

    //i日目までの最大値(0->サポーター, 1->サポーターじゃない)
    vector<vector<ll>> dp(n + 1, vector<ll>(2, INF));
    dp[0][0] = 0;
    rep(i, n){
        chmin(dp[i + 1][0], min(dp[i][0], dp[i][1]) + a[i]);
        chmin(dp[i + 1][1], min(dp[i][0] + x, dp[i][1]) + k);
    }

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

    return 0;
}