#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=200007,pot=1<<20;

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

map<ll,int>id;

ll seg[2*pot+7];
void ins(int v,ll x)
{
	v+=pot-1;
	seg[v]=x;
	while(v>1)
	{
		v/=2;
		seg[v]=min(seg[2*v],seg[2*v+1]);
	}
}
ll que(int v,int a,int b,int l,int r)
{
	if(a<=l&&b>=r) return seg[v];
	if(r<a||l>b) return infl;
	return min(que(2*v,a,b,l,(l+r)/2),que(2*v+1,a,b,(l+r)/2+1,r));
}
ll seg1[2*pot+7];
void ins1(int v,ll x)
{
	v+=pot-1;
	seg1[v]=x;
	while(v>1)
	{
		v/=2;
		seg1[v]=max(seg1[2*v],seg1[2*v+1]);
	}
}
ll que1(int v,int a,int b,int l,int r)
{
	if(a<=l&&b>=r) return seg1[v];
	if(r<a||l>b) return -infl;
	return max(que1(2*v,a,b,l,(l+r)/2),que1(2*v+1,a,b,(l+r)/2+1,r));
}

set<int>xd;

void del(int l,int r)
{
	while(true)
	{
		int i=*xd.lower_bound(l);
		if(i>r) break;
		ins(i,infl); 
		ins1(i,-infl); 
		xd.erase(i);
	}
}

void upd(int l,int r,int k,ll A,ll B,int a,int b)
{
	//cout<<l<<" "<<r<<" "<<k<<" "<<A<<" "<<B<<" "<<a<<" "<<b<<endl;
	mn[k]=min(mn[k],A+que(1,l,min(r,a),1,pot));
	mn[k]=min(mn[k],A+que(1,max(l,a+1),r,1,pot)-1);
	mx[k]=max(mx[k],B+que1(1,l,min(r,b),1,pot));
	mx[k]=max(mx[k],B+que1(1,max(l,b+1),r,1,pot)-1);
}

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;
    set<ll>S;
    S.insert(0);
    for(int i=1;i<=n;i++)
    {
		cin>>l[i]>>r[i];
		S.insert(l[i]%d);
		S.insert(r[i]%d);
		S.insert((r[i]+1)%d);
		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];
		S.insert(X[i]%d);
		V.pb({X[i],i+n});
	}
	int it=0;
	for(auto x:S) id[x]=++it;
	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;
	xd.insert(inf);
	for(int i=1;i<2*pot;i++)
	{
		seg[i]=infl;
		seg1[i]=-infl;
	}
	for(int i=0;i<=n;i++)
	{
		if(i>0)
		{
			if(r[i]-l[i]+1>=d) del(1,it);
			else if(id[r[i]%d]>=id[l[i]%d]) del(id[l[i]%d],id[r[i]%d]);
			else
			{
				del(1,id[r[i]%d]);
				del(id[l[i]%d],it);
			}
			mn[i]++;
			mx[i]++;
		}
		ins(id[(r[i]+1)%d],mn[i]-(r[i]+1)/d);
		ins1(id[(r[i]+1)%d],mx[i]-(r[i]+1)/d);
		//cout<<"INS "<<id[(r[i]+1)%d]<<endl;
		xd.insert(id[(r[i]+1)%d]);

		for(auto [x,k]:Q[i])
		{
			//cout<<"AAA "<<id[x%d]<<endl;
			if(x-r[i]>=d) upd(1,it,k,r[i]/d+1,x/d,id[r[i]%d],id[x%d]);
			else if(id[(r[i]+1)%d]<=id[x%d]) upd(id[(r[i]+1)%d],id[x%d],k,r[i]/d+1,x/d,id[r[i]%d],id[x%d]);
			else
			{
				upd(id[(r[i]+1)%d],it,k,r[i]/d+1,x/d,id[r[i]%d],id[x%d]);
				upd(1,id[x%d],k,r[i]/d+1,x/d,id[r[i]%d],id[x%d]);
			}
			/*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/2) 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;
}