#include <iostream>

#define int long long

using namespace std;

int a[200003],suf[200003],big[200003];
int n,k,m,c,d;

bool check(int mid)
{
	for(int i=0;i<=n+1;i++){
		suf[i]=0;
	}
	
	big[0]=0;
	for(int i=1;i<=n;i++){
		int del;
		if(d) del=min(m,max(0ll,(mid-(a[i]+c)+d-1)/d));
		else del=(mid<=a[i]+c)?0:m;
		
		suf[min(n-m+1,max(1ll,i-m+1))]++;
		suf[min(n-m+2,max(1ll,i-del+1))]--;
		
		big[i]=big[i-1]+(a[i]>=mid);
	}
	
	
	for(int i=1;i<=n+1;i++){
		suf[i]+=suf[i-1];
	}
	
	int cnt=0;
	for(int i=1;i<=n-m+1;i++){
		cnt=max(cnt,big[i-1]+suf[i]+(big[n]-big[i+m-1]));
	}
	
	return cnt>=k;
}

signed main()
{
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	
	cin>>n>>k>>m>>c>>d;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	
	int l=0,r=1e9;
	while(l<r)
	{
		int mid=(l+r+1)/2;
		
		if(check(mid)) l=mid;
		else r=mid-1;
	}
	
	cout<<l<<'\n';
	
	return 0;
}