#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;

typedef long long ll;
const int N = 2e5;

	int n, k, m;
	ll c, d;
	ll a[N + 3];
	int s[N + 3];
	
bool check(ll x){
	memset(s, 0, (n + 1) * (sizeof(int)));
	for(int i = 1; i <= n; i++){
//		printf("i=%3d\n", i);
		if(a[i] >= x){
			s[1]++;
			s[n + 1]--;
			continue;
		}
		ll l, r, div;
		if(a[i] + c >= x){
			l = max(1, i - m + 1);
			r = i;
		}
		else {
			if(d == 0)
				continue;
			
			div = (x - c - a[i]) / d + ((x - c - a[i]) % d != 0);
			
//			printf("x=%lld  c=%lld  a[i]=%lld  div=%lld\n", x, c, a[i], div);
			
			r = i - (div + 1) + 1;
			l = max(1, i - m + 1);
			if(r < 1)
				continue;
				
		}
		
//		printf("l=%3d  r=%3d\n", l, r);
		
		s[l]++;
		s[r + 1]--;
	}
	
//	printf("\n");
	
	int maxc = 0;
	for(int i = 1; i <= n; i++){
		s[i] += s[i - 1];
		maxc = max(maxc, s[i]);
	}
	
	return maxc >= k;
}

int main(){
	scanf("%d%d%d%lld%lld", &n, &k, &m, &c, &d);
	for(int i = 1; i <= n; i++)
		scanf("%lld", &a[i]);
		
//	check(5);
//	return 0;
		
	ll l = 1, r = 2e15, mid, ans;
	while(l <= r){
//		printf("%lld,%lld\n", l, r);
		mid = (l + r) >> 1;
		if(check(mid)){
			ans = mid;
			l = mid + 1;
		}
		else 
			r = mid - 1;
	}
	
	printf("%lld", ans);


	return 0;

}