#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
ll mod=1000000007;
ll mod1=998244353;

const int N=2007;

ll l[N],r[N];
vector<pair<ll,int>>Q[N];
ll mn[2*N],mx[2*N];
ll X[N];
ll d;

bool inside(ll l,ll r,ll x)
{
	return l+(x-l%d+d)%d<=r;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,q;
    ll a,b;
    cin>>n>>q>>d>>a>>b;
    vector<pair<ll,int>>V;
    for(int i=1;i<=n;i++)
    {
		cin>>l[i]>>r[i];
		if(r[i]+1>=d) V.pb({r[i]+1-d,i});
	}
    for(int i=1;i<=n+q;i++)
    {
		mn[i]=infl;
		mx[i]=-infl;
	}
	for(int i=1;i<=q;i++)
	{
		cin>>X[i];
		V.pb({X[i],i+n});
	}
	sort(all(V));
	int j=0;
	for(auto [x,i]:V)
	{
		while(j<n&&x>r[j+1]) j++;
		if(j==n||x<l[j+1]) Q[j].pb({x,i});
	}
	r[0]=-1;
	for(int i=0;i<=n;i++)
	{
		if(i>0)
		{
			mn[i]++;
			mx[i]++;
		}
		for(int j=i;j<=n;j++)
		{
			if(inside(l[j],r[j],(r[i]+1)%d)) break;
			for(auto [x,k]:Q[j])
			{
				if(inside(r[j]+1,x,(r[i]+1)%d))
				{
					mn[k]=min(mn[k],mn[i]+(r[j]+1-(r[i]+1)+d-1)/d);
					mx[k]=max(mx[k],mx[i]+(x-(r[i]+1))/d);
				}
			}
		}
	}
	for(int i=1;i<=q;i++)
	{
		if(mn[n+i]==infl) cout<<-1<<endl;
		else
		{
			ll w1=(X[i]-mn[n+i]*d)*a+b*mn[n+i];
			ll w2=(X[i]-mx[n+i]*d)*a+b*mx[n+i];
			cout<<min(w1,w2)<<endl;
		}
	}
    return 0;
}