#include<bits/stdc++.h> // #include<atcoder/modint> // #include<atcoder/convolution> #define pb push_back #define eb emplace_back #define mp make_pair #define F first #define S second #define rs resize #define ft front() #define bk back() #define int long long #define vi vector<int> #define vvi vector<vector<int>> #define pii pair<int, int> #define vpii vector<pair<int, int>> #define vc vector<char> #define vb vector<bool> #define mii map<int,int> #define f0r(i,n) for(int i=0;i<n;i++) #define FOR(i,k,n) for(int i=k;i<n;i++) #define r0f(i,n) for(int i = n-1; i >= 0; i--) #define R0F(i,k,n) for(int i = n-1; i >= k; i--) #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define SUM(v) (accumulate(all(v), 0LL)) #define in(a) int a; cin>>a #define in2(a,b) int a,b; cin>>a>>b #define in3(a,b,c) int a,b,c; cin>>a>>b>>c #define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d #define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];} #define out(a) cout<<a<<'\n' #define out2(a,b) cout<<a<<' '<<b<<'\n' #define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n' #define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n' #define pout(a) cout<<a.first<<' '<<a.second<<'\n' #define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl #define dout(a) cout<<a<<' '<<#a<<endl #define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl #define YN(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';} #define yn(x); if(x){cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';} #define p2(x) (1LL << (x)) #define pct(x) (__builtin_popcountll((x))) #define ist(x,y) (((x) >> (y)) & 1) template<class T, class U> bool ckmin(T& a, const U& b) { return (T)b < a ? a = (T)b, 1 : 0; } template<class T, class U> bool ckmax(T& a, const U& b) { return a < (T)b ? a = (T)b, 1 : 0; } const int leg = 1e9 + 7; const int mod = 998244353; using namespace std; // using namespace atcoder; // using mint = modint998244353; // using mint = modint1000000007; const int mxn = 5e5 + 5, mxk = 1e13 + 5; // mint fact[mxn], inv[mxn]; // mint C(int n, int r){return fact[n] * inv[n-r] * inv[r];} // mint snb(int n, int r){return C(n + r, n);} int n,q,D,A,B; vpii w; vi f, a, b, pos, pab; int check(int x){ //segment of x int lo = -1, hi = n-1; //last one with l <= x while(lo < hi){ int mid = lo + (hi-lo+1)/2; if(w[mid].F <= x)lo=mid; else hi=mid-1; } if(lo==-1)return -1; if(w[lo].S >= x)return lo; return -1; } int nxt(int x){ //next free int f = check(x); if(f!=-1)return x; int lo = 0, hi = n; while(lo < hi){ int mid = lo + (hi - lo) / 2; if(w[mid].F >= x)hi = mid; else lo=mid+1; } if(lo==n)return -1; else return w[lo].F; } int prev(int x){ //prev free int f = check(x); if(f!=-1)return x; int lo = -1, hi = n-1; while(lo < hi){ int mid = lo + (hi - lo + 1) / 2; if(w[mid].S <= x)lo=mid; else hi=mid-1; } if(lo==-1)return -1; else return w[lo].S; } int get(int x){ // bool flag = (x==123); int seg = check(x); if(seg==-1)x=prev(x), seg = check(x); if(f[seg] > x)seg=pab[seg-1], x = w[seg].S; //if(flag)dout2(x,seg), dout2(f[seg],b[seg]), dout(pos[seg]); return (x - f[seg]) / D + b[seg] + (((x-f[seg]) % D) >= pos[seg]); } signed main(){ ios::sync_with_stdio(false); cin.tie(NULL); //ifstream cin(".in"); //ofstream cout(".out"); // fact[0]=1;FOR(i,1,mxn)fact[i]=fact[i-1]*i;inv[mxn-1]=fact[mxn-1].inv();r0f(i,mxn-1)inv[i]=inv[i+1]*(i+1); cin>>n>>q>>D>>A>>B; vpii tmp; f0r(i,n){in2(a,b); tmp.eb(a,b);} int pv = 0; f0r(i,n){ w.eb(pv, tmp[i].F-1); pv = tmp[i].S + 1; } w.eb(pv, mxk); n++; f.rs(n); a.rs(n); b.rs(n); pos.rs(n); f0r(i,n)f[i]=1e18, a[i] = 1e18, b[i]=-1, pos[i] = 1e18; f[0] = 0, b[0] = 0, a[0] = 0; vi dif(n+1); int cur = 0; int ptr = 0; f0r(i,n){ cur+=dif[i]; if(cur > 0)f[i] = w[i].F; if(f[i] > w[i].S)continue; if(f[i] + D > mxk)continue; int a = f[i] + D, b = min(w[i].S + D, mxk); //dout2(a,b); // while(ptr<n && w[ptr].S<a)ptr++; if(ptr==n || w[ptr].F > b)continue; // while(ptr<n && w[ptr].F <= b){ // ckmin(::a[ptr], ::a[i] + 1); ptr++; // } int seg = check(a); if(seg == -1){ int L = check(nxt(a)), R = check(prev(b)); if(L <= R)dif[L]++, dif[R+1]--; FOR(j, L, R+1)ckmin(::a[j], ::a[i]+1); } else{ if(f[seg]==1e18)f[seg]=a; int L = seg+1, R = check(prev(b)); if(L <= R)dif[L]++, dif[R+1]--; ckmin(::a[seg], ::a[i]+1); FOR(j, L, R+1)ckmin(::a[j], ::a[i]+1); } } //vout(f); // vout(a); pab.rs(n); pv=0; f0r(i,n){ if(f[i] != 1e18)pv = i; pab[i] = pv; } FOR(i,1,n){ if(f[i] == 1e18)continue; int cur = f[i] - D; //dout(cur); dout2(i,get(cur)); b[i] = get(cur) + 1; int lo = f[i] + 1, hi = min(f[i]+D, w[i].S+1); //find first one that is b[i] + 1 while(lo < hi){ int mid = lo + (hi-lo) / 2; cur = mid-D; if(get(cur) == b[i])hi=mid; else lo=mid+1; } pos[i] = lo - f[i]; }// dout(get(123)); while(q--){ in(x); int seg = check(x); if(seg==-1)out(-1); else if(f[seg] <= x){ //dout(seg); // dout(get(x)); dout(x); dout((B-A*D)); // dout(::a[seg]); if(A*D <= B)out(A * x + (B-A*D) * ::a[seg]); else out(A * x + (B-A*D) * (get(x))); } else out(-1); } }