//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int n,q;
ll l[200200],r[200200];
ll st[200200],cnt[200200],ch[200200];
ll D,A,B;
ll get_cnt(int p,ll pos)
{
	if(pos<ch[p]) return cnt[p];
	return cnt[p]+1+(pos-ch[p])/D;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>q;
	cin>>D>>A>>B;
	bool type=B>=A*D;
	for(int i=1;i<=n;i++)
		cin>>l[i]>>r[i];
	l[n+1]=0x3f3f3f3f3f3f3f3f;
	memset(st,0x3f,sizeof(st));
	st[0]=0;
	ch[0]=(l[1]<=D?0x3f3f3f3f3f3f3f3f:D);
	int p=0;
	for(int i=1;i<=n;i++)
	{
		if(r[i]-l[i]+1>=D) break;
		ll pos=r[i]+1-D;
		while(l[p+1]<=pos) p++;
		while(p<i&&st[p]==0x3f3f3f3f3f3f3f3f)
			p++;
		if(p<i&&max(st[p],pos)+D<l[i+1])
		{
			st[i]=max(st[p],pos)+D;
			if(type)
				cnt[i]=cnt[p]+1;
			else
			{
				cnt[i]=get_cnt(p,max(st[p],pos))+1;
				ch[i]=max(st[p],pos)+D+D;
				ll val=max(st[p],pos);
				if(val<ch[p]) val=ch[p];
				else val=(val-ch[p])/D*D+D+ch[p];
				if(val<l[p+1])
					ch[i]=min(ch[i],val+D);
				for(int pp=p+1;pp<i;pp++)
				{
					if(st[pp]!=0x3f3f3f3f3f3f3f3f&&cnt[pp]+1>cnt[i])
						ch[i]=min(ch[i],st[pp]+D);
					if(st[pp]!=0x3f3f3f3f3f3f3f3f&&cnt[pp]+2>cnt[i])
						ch[i]=min(ch[i],ch[pp]+D);
				}
				if(ch[i]>=l[i+1])
					ch[i]=0x3f3f3f3f3f3f3f3f;
			}
		}
	}
	for(int i=1;i<=q;i++)
	{
		ll pos;
		cin>>pos;
		int lp=0,rp=n;
		while(lp<rp)
		{
			int mid=(lp+rp+1)/2;
			if(r[mid]>=pos)
				rp=mid-1;
			else
				lp=mid;
		}
		if(pos>=l[lp+1])
			cout<<"-1\n";
		else if(pos<st[lp])
			cout<<"-1\n";
		else if(type)
			cout<<(pos-cnt[lp]*D)*A+cnt[lp]*B<<'\n';
		else
		{
			ll c=get_cnt(lp,pos);
			cout<<(pos-c*D)*A+c*B<<'\n';
		}
	}
	return 0;
}