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

long long a[500005];

int main()
{
	long long n,k,m,c,d;
	cin>>n>>k>>m>>c>>d;
	
	priority_queue<long long,vector<long long>,greater<long long>> q;
	
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
		if(q.size()<k)
		{
			q.push(a[i]);
		}
		else if(a[i]>q.top())
		{
			q.pop();
			q.push(a[i]);
		}
	}
	
	long long p=q.top(),pos=0,st=0,ed=0;
	
	long long sum=0,maxp=0,sump=0,posp=0;
	while(ed<m-1)
	{
		if(a[ed]+c>p)
		{
			sum++;
		}
		if(a[ed]==p)
		{
			sump++;
		}
		ed++;
	}

	int i=st,j=ed;
	while(j<n)
	{
		if(sum>maxp||(sum==maxp&&sump>posp))
		{
			st=i;
			ed=j;
			maxp=sum;
			posp=sump;
		}
	
		//maxp=max(maxp,sum);
		if(a[i]+c>p)
		{
			sum--;
			if(a[i]==p)
			{
				sump--;
			}
		}
		i++;
		j++;
		if(a[j]<=p)
		{
			sum++;
			if(a[i]==p)
			{
				sump++;
			}
		}
	}
	//cout<<"st:"<<st<<"ed:"<<ed<<endl;

	map<long long,long long> ma;
	//cout<<"st:"<<st<<"ed:"<<ed<<endl;
	for(int i=st;i<=ed;i++)
	{			
		if(a[i]+c>p)
		{
			if(a[i]<=p)
			{
				q.pop();
				q.push(a[i]+c);
				p=q.top();
				while(ma[p]>0)
				{
					ma[p]--;
					q.pop();
					q.push(p+c);
					p=q.top();
				}
			}
			else
			{
				ma[a[i]]++;
			}
		}
		c+=d;
	}
	cout<<q.top()<<endl;
	
	return 0;
}