#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;
using ll = long long;

const int N = 2e5 + 10;

ll n, k, m, c, d;
ll a[N], p[N];

bool check(ll x){
    //难写！
    //预处理<x的时刻
    for (int i = 0; i < n; i ++ ) p[i] = 0;
    int res = 0;
    for (int i = 0; i < n; i ++ ){
        res += a[i] >= x;
    }
    //前m
    for (int i = 0; i < m; i ++ ){
        if (a[i] >= x || a[i] + c + d * i < x) continue;
        res ++;
        //贡献-1
        int pre ;//不行位置
        if (d == 0 || a[i] + c >= x){
            pre = i + 1;
        }else{
            //至少加y次
            int y = (x - c - a[i] + d - 1) / 1;
            pre = i - y;
            pre ++;
        }
        p[pre] ++;
    }
    if (res >= k) return true;
    for (int i = 1; i + m - 1 < n; i ++ ){
        if (a[i+m-1] < x && a[i+m-1] + c + d * (m - 1) >= x) res ++;
        res -= p[i];
        if (res >= k) return true;
    }
    return false;
}

void solve(){
    cin >> n >> k >> m >> c >> d;
    for (int i = 0; i < n; i ++ ) cin >> a[i];

    ll l = 0, r = 1e9 * (2e5 + 10);
    while (l < r){
        ll mid = (l + r + 1) / 2;
        if (check(mid)) l = mid;
        else r = mid - 1;
    }
    cout << l;
}

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