#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 + m; i ++ ) p[i] = 0;
    int res = 0;
    for (int i = m; i < n + m; i ++ ){
        if (a[i] >= x){
            res ++;
        }else if (a[i] + c + d * (m - 1) >= x){
            int pre;
            if (d == 0 || a[i] + c >= x){
                pre = i + 1;
            }else{
                int y = (x - c - a[i] + d - 1) / d;
                pre = i - y + 1;
            }
            p[pre] ++; //pre时刻去除的贡献
        }
    }
    for (int i = 0; i + m - 1 < n + m; i ++ ){
        res -= p[i];
        if (i+m-1>=m&&a[i+m-1]<x&&a[i+m-1]+c+d*(m-1)>=x) res ++;
        if (i >= m && res >= k) return true;
    }
    return false;
}

void solve(){
    cin >> n >> k >> m >> c >> d;
    for (int i = m; i < n + m; 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;
}