#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long LL;

inline int read(){
	int x = 0,fl = 1;char c = getchar();
	while(c < '0'||'9' < c){if(c=='-')fl=-1;c = getchar();}
	while('0' <= c&&c <= '9'){x = (x<<3) + (x<<1) + c - '0';c = getchar();}
	return x * fl;
}

const int maxn = 1e6+20;
int n,m,k,c,d;
LL A[maxn],B[maxn];

bool judge(LL K){
	int cnt = 0;
	LL mx = 0;
	for(int i=1;i<=n;i++) B[i] = 0;
	for(int i=1;i<=n;i++){
		if(A[i] >= K) cnt++;
		else{
			LL res = K - A[i];
			if(res <= c){
				B[i + 1]--;
				B[max(1ll,i - m + 1)]++;	
			}
			else{
				if(d){
					LL t=(res-c)/d+( (res-c)%d!=0 )+ 1;
					if(t <= m){
						B[max(1ll,i - t + 2)]--;
						B[max(1ll,i - m + 1ll)]++;
					}		
				}
//				else{
//					B[max(1ll,i-m+1ll)]++;
//					B[i+1]--;
//				}
			}
		}
	}
	for(int i=1;i<=n;i++){
		B[i] += B[i-1];
		mx = max(mx,B[i]);
	}
	return mx + cnt >= k;
}

void solve(){
	n = read();k = read();m = read();c = read();d = read();
	for(int i=1;i<=n;i++) A[i] = read();
	LL L = 0,R = 1e18;
//	cout<<"????"<<endl;
	while(L<R){
		LL mid = ((L+R+1)>>1);
		if(judge(mid)) L = mid;
		else R = mid - 1;
//		cout<<L<<" "<<R<<endl;
	}
	printf("%lld\n",L);
}

signed main(){
	int T = 1;
//	T = read();
	while(T--) solve();
	return 0;
}

//6 4 3 1 2
// 1 1 4 5 1 4