rt

#include<bits/stdc++.h>
#define int long long
using namespace std;
int t,a[2000001],sum[2000001],cnt[2000001],f[2000001],ans[2000001];
void dfs(int,int,int,int);
signed main()
{
	int n,s,k,m,q;
	cin>>n>>t>>s>>k;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		m=max(m,a[i]);
		cnt[a[i]]++;
		sum[a[i]]+=a[i];
	}
	for(int i=1,num=cnt[0];i<=m;i++)
	{
		f[i]=f[i-1]+num*k+s;
		num+=cnt[i];
	}
	for(int i=m;i>=1;i--)
	{
		cnt[i-1]+=cnt[i];
		sum[i-1]+=sum[i];
	}
	dfs(0,m,0,m);
	cin>>q;
	while(q--)
	{
		int x;
		cin>>x;
		cout<<ans[x]<<" ";
	}
	return 0;
}
void dfs(int left,int right,int tleft,int tright)
{
	if(left>right)
	{
		return;
	}
	int middle=(left+right)>>1,times,minutes=9e18;
	for(int i=tleft;i<=tright;i++)
	{
		int res=f[i]+(sum[i+middle]-cnt[i+middle]*(i+middle))*t;
		if(res<minutes)
		{
			minutes=res;
			times=i;
		}
	}
	ans[middle]=minutes;
	dfs(left,middle-1,times,tright);
	dfs(middle+1,right,tleft,times);
}