#include <bits/stdc++.h>

using namespace std;

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

constexpr int maxval = 1e6 + 5;

long long dp[maxval];

int dp2[maxval];

void solve() {
    int n, q;
    cin >> n >> q;
    long long d;
    int a, b;
    cin >> d >> a >> b;
    for (int i = 0; i < maxval; ++i) {
        dp[i] = inf;
    }
    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++;
        for (int j = lr[i].first; j < lr[i].second; ++j) {
            dp[j] = inf * 2;
        }
    }
    dp[0] = 0;
    dp2[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);
                dp2[i + 1] = max(dp2[i + 1], dp2[i]);
            }
            if (i + d < maxval && dp[i + d] != inf * 2) {
                dp[i + d] = min(dp[i + d], dp[i] + b);
                dp2[i + d] = max(dp2[i + d], dp2[i] + 1);
            }
        }
    }
    for (int i = 0; i + 1 < maxval; ++i) {
        if (dp[i] < inf && dp[i + 1] < inf) {
            assert(dp2[i] + 1 >= dp2[i + 1]);
        }
    }
    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;
}