#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, q;
    cin >> n >> q;

    ll D, A, B;
    cin >> D >> A >> B;

    vector<pair<ll, ll>> s(n);
    for (auto &[l, r] : s) {
        cin >> l >> r;
    }
    n += 1;
    s.push_back({3e18, 3e18});

    vector<ll> X(q);
    for (int i = 0; i < q; ++i) {
        cin >> X[i];
    }

    set<pair<ll, ll>> t;
    t.insert({0, 0});

    auto add = [&](ll l, ll r) {
        auto it = t.lower_bound({l + 1, -1});
        if (it != t.begin() && prev(it)->second >= r) {
            return;
        }
        ll nxr = r;
        while (it != t.end()) {
            if (it->first > nxr + 1) {
                break;
            }
            nxr = it->second;
            it = t.erase(it);
        }
        it = t.lower_bound({l + 1, -1});
        if (it != t.begin()) {
            ll nxl = l;
            while (it != t.begin()) {
                --it;
                if (it->second + 1 < nxl) {
                    break;
                }
                nxl = it->first;
                it = t.erase(it);
            }
            l = nxl;
        }
        t.emplace(l, nxr);
    };

    for (int i = 0; i < n; ++i) {
        ll L = s[i].first;
        ll P = (i == 0 ? 0 : s[i - 1].second + 1);
        auto it = t.lower_bound(pair(P, -1));
        ll mn = 3e18;
        if (it != t.end()) {
            mn = min(mn, it->first);
        }
        if (it != t.begin()) {
            --it;
            if (it->second >= P) {
                mn = min(mn, P);
            }
        }
        if (mn >= L) {
            continue;
        }
        ll l = mn, r = L - 1;
        add(l, r);
        add(l + D, r + D);
    }

    for (int i = 0; i < q; ++i) {
        ll x = X[i];
        auto it = std::lower_bound(s.begin(), s.end(), pair<ll, ll>(x + 1, -1)) - s.begin();
        if (it != 0 && s[it - 1].second >= x) {
            cout << "-1\n";
        } else {
            auto f = t.lower_bound({x + 1, -1});
            if (f != t.begin() && prev(f)->second >= x) {
                cout << x << '\n';
            } else {
                cout << "-1\n";
            }
        }
    }

    return 0;
}