#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main()
{
    int n, k, x, sum, tmp = 0;
    cin >> n;
    cin >> k;
    cin >> x;
    vector<int> a(n);
    for (auto &nx : a)
    {
        cin >> nx;
    };
    sum = 0;
    for (int i = 0; i < n; i++)
    {
        vector<int> b(i + 1);
        for (int j = 0; j <= i; j++)
        {
            b[j] = a[j];
        }
        sort(b.rbegin(), b.rend());
        tmp = 0;

        for (int j = 0; j < min(k, i + 1); j++)
        {
            tmp = tmp + b[j];
        }
        tmp = tmp - x * (i + 1);
        if (tmp >= sum)
        {
            sum = tmp;
        }
    }
    cout << sum;
}