#include <bits/stdc++.h>
using namespace std;

#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define int long long
#define pb push_back
#define ff first
#define ss second
typedef pair<int, int> PII;
const int N = 1000005;
const int inf = 1e18;
const int mod = 1e9+7;
mt19937_64 rng(time(0));

int n,k,m,c,d;
int a[N];
bool check(int x){
    vector<int>v(n+5,0);
    int sum=0;
    for(int i=1;i<=n;i++){
        if(a[i]>=x){
            sum++;
        }
        else{
            int cnt=x-a[i]-c;
            cnt=max(cnt,0LL);
            if(d==0){
                if(cnt==0){
                    int rr=i-cnt;
                    int ll=max(1LL,i-m+1);
                    v[ll]++;
                    v[rr+1]--;
                }
                continue;
            }
            int need=cnt/d;
            if(cnt%d)need++;
            if(need>m-1||i-cnt<1)continue;
            else{
                int rr=i-cnt;
                int ll=max(1LL,i-m+1);
                v[ll]++;
                v[rr+1]--;
            }
        }
    }
    for(int i=1;i<=n;i++){
        v[i]=v[i-1]+v[i];
        if(sum+v[i]>=k){
            return 1;
        }
    }
    return 0;
}
void solve() {
    cin>>n>>k>>m>>c>>d;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }

    int l=0,r=1e15;
    while(l<r){
        int mid=l+r+1>>1;
        if(check(mid)){
            l=mid;
        }
        else{
            r=mid-1;
        }
    }
    cout<<l<<'\n';
}
signed main() {
    ios;
    int _ = 1;
    //cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}