#include <bits/stdc++.h>
using namespace std;
using LL = 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];
    }

    auto check = [&](LL mid) -> bool {
        vector<LL> b(n + 2);
        LL cnt = 0;
        for (int i = 1; i <= n; i++) {
            b[i] = (a[i] >= mid);
            cnt += (a[i] >= mid);
        }
        if (cnt >= k) {
            return true;
        }
        for (int i = 1; i <= n; i++) {
            if (a[i] >= mid) continue;
            if (a[i] + c + 1LL * d * (m - 1) < mid) continue;
            b[i]++;
            if (d == 0) {
                b[min(n + 1, i + m)]--;
            } else {
                LL x = (mid - a[i] - c) / d;
                LL r = max(1LL, 1LL * i + m - 1 - x);
                b[r]--;
            }
        }

        for (int i = 1; i <= n; i++) {
            b[i] += b[i - 1];
            if (b[i] + cnt >= k) {
                return true;
            }
        }
        return false;
    };

    LL l = 0, r = 1e18;
    while (l < r) {
        LL mid = (l + r + 1) / 2;
        if (check(mid)) {
            l = mid;
        } else {
            r = mid - 1;
        }
    }
    cout << l << "\n";
}

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

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}