#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vpi = vector<pair<int, int>>;
using vpl = vector<pair<ll, ll>>;
#define rep(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define repr(i, s, n) for (int i = (s); i >= (int)(n); --i)
#define sz(x) ((int)(x).size())
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
auto _ = []{ios::sync_with_stdio(false); cin.tie(nullptr); return 0;}();
const int INFI = 1 << 30;
const ll INFL = 1LL << 62;

int main() {
	ll n, k, x;
	cin >> n >> k >> x;
	vl a (n);
	rep(i, 0, n){
		cin >> a[i];
	}
	ll mx=-INFL;
	priority_queue<ll, vector<ll>, greater<ll>>q;
	ll sm=0;
	rep (i, 0, n){
		sm+=a[i];
		q.push(a[i]);
		if(sz(q)>k){
			sm-=q.top();
			q.pop();
		}
		chmax(mx,sm-x*(i+1)) << '\n';
	}
	cout << mx << '\n';
	

	return 0;
}