#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    ll K, X;
    cin >> N >> K >> X;
    vector<ll> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];

    ll total = 0;
    for (ll a : A) total += a;

    ll dp0 = 0;
    ll dp1 = -(1LL<<60);

    for (int i = 0; i < N; i++) {
        ll diff = A[i] - K;
        ll new_dp1 = max(dp1 + diff, dp0 + diff - X);
        ll new_dp0 = max(dp0, new_dp1);
        dp0 = new_dp0;
        dp1 = new_dp1;
    }

    ll best = max(dp0, dp1);
    cout << total - best << "\n";
    return 0;
}