#include <bits/stdc++.h>

void unique(auto& vec) {
    std::sort(vec.begin(), vec.end());
    vec.erase(std::unique(vec.begin(), vec.end()), vec.end());
}

constexpr int64_t X = 1e6 + 5;

int32_t main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, q;
    int64_t D, A, B;
    std::cin >> n >> q >> D >> A >> B;
    std::vector<std::pair<int64_t, int64_t>> segs(n);

    for (auto& [l, r] : segs) {
        std::cin >> l >> r;
    }
    {
        std::vector<std::pair<int64_t, int64_t>> segs2;
        int64_t L = 0;
        for (auto [l, r] : segs) {
            segs2.push_back({L, l - 1});
            L = r + 1;
        }
        segs2.push_back({L, X - 1});
        segs.swap(segs2);
    }

    std::vector<std::pair<int64_t, int>> quer(q);
    for (int i = 0; i < q; i++) {
        auto& [x, id] = quer[i];
        std::cin >> x;
        id = i;
    }

    std::vector<int64_t> dp(X, 4e18);
    dp[0] = 0;
    for (int i = 1; i < X; i++) {
        int it = std::lower_bound(segs.begin(), segs.end(), std::pair<int64_t, int64_t>{i + 1, -1}) - segs.begin();
        if (it > 0 && segs[it - 1].first <= i && i <= segs[it - 1].second) {
            dp[i] = std::min<int64_t>(dp[i - 1] + A, i - D >= 0 ? dp[i - D] + B : 1e18);
        }
    }

    for (int i = 0; i < q; i++) {
        auto [x, id] = quer[i];
        std::cout << (dp[x] < 1e18 ? dp[x] : -1) << " \n"[i == q - 1];
    }

    return 0;
}