#include "overtaking.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll INF = 3'000'000'000'000'000'000;

vector<vector<pair<ll, ll>>> all;
vector<vector<ll>> ph;
vector<vector<ll>> aws;
vector<int> ns, nw;
int nx;

random_device rd;
mt19937 rnd(rd());

void init(int l, int n, vector<ll> t, vector<int> w, int x, int m, vector<int> s) {
	nx = x;
	ns = s;
	nw = w;
	vector<pair<ll, ll>> need;
	for (ll i = 0; i < n; i++) {
		if (w[i] > x) {
			need.emplace_back(t[i], i);
		}
	}
	sort(need.begin(), need.end());
	all.resize(m);
	all[0] = need;
	ph.resize(m);
	for (ll i = 1; i < m; i++) {
		ll now = s[i] - s[i - 1];
		vector<tuple<ll, ll, ll>> nneed;
		ll lst = 0;
		for (ll j = 0; j < all[i - 1].size(); j++) {
			auto[nt, ni] = all[i - 1][j];
			nt += w[ni] * now;
			nt = max(nt, lst);
			nneed.emplace_back(nt, w[ni], ni);
			lst = nt;
		}
		sort(nneed.begin(), nneed.end());
		for (auto[nt, _, ni] : nneed) {
			all[i].emplace_back(nt, ni);
		}
	}
	vector<ll> to(n);
	for (ll i = 0; i < n; i++) {
		to[i] = rnd();
	}
	for (ll i = 0; i < m; i++) {
		ph[i].push_back(0);
		for (auto[_, ni] : all[i]) {
			ph[i].push_back(ph[i].back() + to[ni]);
		}
	}
	aws.resize(m);
	for (ll i = m - 1; i >= 0; i--) {
		for (ll j = 0; j < all[i].size(); j++) {
			auto[nt, ni] = all[i][j];
			ll l = i, r = m;
			while (r - l > 1) {
				ll mid = (l + r) / 2;
				if (ph[mid][j] != ph[i][j] || (j > 0 && all[mid][j - 1].first >= nt + x * (s[mid] - s[i]))) {
					r = mid;
				} else {
					l = mid;
				}
			}
			l++;
			if (l == m) {
				aws[i].push_back(nt + x * (s.back() - s[i]));
			} else {
				nt = all[l - 1][j - 1].first + w[all[l - 1][j - 1].second] * (s[l] - s[l - 1]);
				ll it = lower_bound(all[l].begin(), all[l].end(), make_pair(nt, -1ll)) - all[l].begin();
				aws[i].push_back(aws[l][it]);
			}
		}
	}
}

ll arrival_time(ll y) {
	ll nt = y;
	ll i = 0;
	ll m = all.size();
	ll j = lower_bound(all[0].begin(), all[0].end(), make_pair(y, -1ll)) - all[0].begin();
	ll l = 0, r = m;
	while (r - l > 1) {
		ll mid = (l + r) / 2;
		if (ph[mid][j] != ph[i][j] || (j > 0 && all[mid][j - 1].first >= nt + nx * (ns[mid] - ns[i]))) {
			r = mid;
		} else {
			l = mid;
		}
	}
	l++;
	if (l == m) {
		return nt + nx * (ns.back() - ns[i]);
	} else {
		nt = all[l - 1][j - 1].first + nw[all[l - 1][j - 1].second] * (ns[l] - ns[l - 1]);
		ll it = lower_bound(all[l].begin(), all[l].end(), make_pair(nt, -1ll)) - all[l].begin();
		return aws[l][it];
	}
}

#ifdef LOCAL
int main()
{
    int L, N, X, M, Q;
    assert(5 == scanf("%d %d %d %d %d", &L, &N, &X, &M, &Q));
    std::vector<long long> T(N);
    for (int i = 0; i < N; i++)
        assert(1 == scanf("%lld", &T[i]));
    std::vector<int> W(N);
    for (int i = 0; i < N; i++)
        assert(1 == scanf("%d", &W[i]));
    std::vector<int> S(M);
    for (int i = 0; i < M; i++)
        assert(1 == scanf("%d", &S[i]));
    std::vector<long long> Y(Q);
    for (int i = 0; i < Q; i++)
        assert(1 == scanf("%lld", &Y[i]));

    fclose(stdin);

    init(L, N, T, W, X, M, S);
    std::vector<long long> res(Q);
    for (int i = 0; i < Q; i++)
        res[i] = arrival_time(Y[i]);

    for (int i = 0; i < Q; i++)
        printf("%lld\n", res[i]);
    fclose(stdout);
    return 0;
}
#endif