#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
using i64 = long long;
void solve() {
    int n, k, m, c, d;
    cin >> n >> k >> m >> c >> d;

    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    tree<pair<int, int>, null_type, greater<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> t1;
    tree<pair<int, int>, null_type, greater<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> t2;

    for (int i = m; i <= n; i++) {
        t1.insert({a[i], i});
    }
    for (int i = 1; i < m; i++) {
        t2.insert({a[i] + c + (i - 1) * d, i});
    }
    auto kth1 = [&](int k) {
        auto it = t1.find_by_order(k - 1);
        if (it != t1.end()) {
            return it->first;
        } else {
            assert(0);
            //while(1);
            return -1LL;
        }
    };
    auto kth2 = [&](int k) {
        auto it = t2.find_by_order(k - 1);
        if (it != t2.end()) {
            return it->first;
        } else {
            //assert(0);
            while(1);
            return -1LL;
        }
    };

    auto rk1 = [&](int x) {
        return t1.order_of_key({x, -1});
    };
    auto rk2 = [&](int x) { // <= 
        return t2.order_of_key({x, -1});
    };

    auto check = [&](int x, int i) {
        //if(i == 5) cout<<kth2(3)-(i-m)*d<<"kth2\n";
        i64 y = kth2(x) - (i-m)*d;
        int t = rk1(y) + x;
        //if(y == 2) cout<<rk1(y)<<"rk1\n";
        //if(i == m) cout<<rk1(4)<<"rk1\n";
        return t;
    };

    i64 ans = 0;
    for (int i = m; i <= n; i++) {
        t1.erase({a[i], i});
        t2.insert({a[i] + c + (i - 1) * d, i});

        int l = 0, r = min(k, m) + 1;
        while (r - l > 1) {
            int mid = l + r >> 1;
            if (check(mid, i) >= k) r = mid;
            else l = mid;
        }
        if(r == min(k, m) + 1) {
            int t = k - r + 1;
            //cout<<r<<" "<<check(r, i)<<"\n";
            ans = max(ans, kth1(t));
            //cout<<"-1\n";
            //cout<<t<<"\n";
            //cout<<i<<" "<<kth1(t)<<"\n";
        }else {
            //cout<<i<<" "<<kth2(r)-(i-m)*d<<"\n";
            ans = max(ans, kth2(r)-(i-m)*d);
        }
        
        t2.erase({a[i - m + 1] + c + (i - m) * d, i - m + 1});
        t1.insert({a[i - m + 1], i - m + 1});
    }
    cout << ans << "\n";
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}