#include<bits/stdc++.h>
#define int long long
using namespace std;
using ll = long long;
using ld = double;
const ll mod = 1e9 + 7;
const ll inf = 1e15 + 5;
const int N = 5e6 + 5;

void solve(){
    int n,k,m,c,d;
    cin>>n>>k>>m>>c>>d;
    vector<int>a(n+5),b;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    if(d==0){
        int l=0,r=1e16;
        while(l<r){
            int mid=l+r+1>>1;
            b=a;
            int ans=0,ok=0;
            for(int i=1;i<=n;i++){
                if(a[i]>=mid){
                    ans++;
                }
                b[i]+=c;
            }
            for(int i=1;i<=n;i++){
                if(a[i]<mid&&b[i]>=mid){
                    ans++;
                }
                if(i>m){
                    if(a[i-m]<mid&&b[i-m]>=mid){
                        ans--;
                    }
                }
                if(ans>=k)ok=1;
            }
            if(ok){
                l=mid;
            }else{
                r=mid-1;
            }
        }
        cout<<l<<'\n';
    }else{
        int l=0,r=1e16;
        while(l<r){
            int mid=l+r+1>>1;
            b=a;
            vector<int>cnt(n+5);
            for(int i=1;i<=m;i++) {
                b[i] += c + (i - 1) * d;
            }
            for(int i=m+1;i<=n;i++){
                b[i]+=c+(m-1)*d;
            }
            for(int i=1;i<=n;i++){
                if(a[i]>=mid||b[i]<mid)continue;
                int num=(b[i]-mid+d)/d;
                int p=min(i-1,m-1);
                if(num>p){
                    if(i+m<=n)cnt[i+1]++;
                }else{
                    if(i+num<=n)cnt[i-(p-num)]++;
                }
            }
            int ans=0,ok=0;
            for(int i=1;i<=n;i++){
                if(a[i]>=mid){
                    ans++;
                }
            }
            for(int i=1;i<=n;i++){
                if(a[i]<mid&&b[i]>=mid){
                    ans++;
                }
                if(i>m){
                    ans-=cnt[i-m+1];
                }
                if(ans>=k){
                    ok=1;
                }
            }
            if(ok){
                l=mid;
            }else{
                r=mid-1;
            }
        }
        cout<<l<<'\n';
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
//    cout<<fixed<<setprecision(6);
//    srand(time(0));
    int T = 1;
//    cin >> T;
    while (T--)solve();
    return 0;
}