#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int main() {
    long long n, k, x;
    cin >> n >> k >> x;
    vector<long long> a(n);
    for (long long &l : a) {
        cin >> l;
    }

    priority_queue<long long, vector<long long>, greater<long long>> q;
    long long score = 0, ans = -1e18;
    for (int i = 0; i < n; i++) {
        q.push(a[i]);
        score += a[i];
        score -= x;
        if (q.size() > k) {
            score -= q.top();
            q.pop();
        }

        // cout << score << endl;

        ans = max(score, ans);
    }

    cout << ans << endl;
}