#include <bits/stdc++.h>

using namespace std;

constexpr long long inf = (long long)1e18 + 7;

constexpr int maxval = 1e6 + 5;

long long dp[maxval];

void solve() {
    int n, q;
    cin >> n >> q;
    long long d;
    int a, b;
    cin >> d >> a >> b;
    vector<pair<long long, long long>> lr(n);
    for (int i = 0; i < n; ++i) {
        cin >> lr[i].first >> lr[i].second;
        lr[i].second++;
    }
    if (false && b >= d * a) {
        vector<pair<pair<long long, long long>, long long>> ans;
        ans.emplace_back(make_pair(0, lr[0].first), 0);
        for (int i = 0; i < n; ++i) {
            long long nxt = inf;
            if (i + 1 < n) {
                nxt = lr[i + 1].first;
            }
            long long mn = lr[i].second - d;
            int pos = lower_bound(ans.begin(), ans.end(), make_pair(make_pair(mn, 0LL), 0LL)) - ans.begin();
            long long start = inf;
            long long cost = inf;
            if (pos < (int)ans.size()) {
                start = ans[pos].first.first;
                cost = ans[pos].second;
            }
            if (pos > 0) {
                pos--;
                if (ans[pos].first.second > mn) {
                    start = mn;
                    cost = min(cost, ans[pos].second);
                }
            };
            if (start + d < nxt) {
                ans.emplace_back(make_pair(start + d, nxt), cost + 1);
            }
        }
        while (q--) {
            long long x;
            cin >> x;
            int pos = lower_bound(ans.begin(), ans.end(), make_pair(make_pair(x + 1, 0LL), 0LL)) - ans.begin() - 1;
            if (x < ans[pos].first.second) {
                cout << x * a + (b - d) * ans[pos].second << '\n';
            } else {
                cout << -1 << '\n';
            }
        }
    } else {
        for (int i = 0; i < maxval; ++i) {
            dp[i] = inf;
        }
        for (int i = 0; i < n; ++i) {
            for (int j = lr[i].first; j < lr[i].second; ++j) {
                dp[j] = inf * 2;
            }
        }
        dp[0] = 0;
        for (int i = 0; i < maxval; ++i) {
            if (dp[i] != -1) {
                if (i + 1 < maxval && dp[i + 1] != inf * 2) {
                    dp[i + 1] = min(dp[i + 1], dp[i] + a);
                }
                if (i + d < maxval && dp[i + d] != inf * 2) {
                    dp[i + d] = min(dp[i + d], dp[i] + b);
                }
            }
        }
        while (q--) {
            long long x;
            cin >> x;
            if (dp[x] >= inf) {
                cout << -1 << '\n';
            } else {
                cout << dp[x] << '\n';
            }
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}