#include <bits/stdc++.h>
#define REP(i, l, r) for (int i = (l); i <= (r); ++ i)
#define DEP(i, r, l) for (int i = (r); i >= (l); -- i)
#define fi first
#define se second
#define pb emplace_back
#define mems(x, v) memset((x), (v), sizeof(x))
using namespace std;
namespace Milkcat {
	typedef long long LL;
	typedef pair<LL, LL> pii;
	const int N = 1e6 + 5;
	struct zmb {
		LL t, id, h;
		bool operator < (const zmb& x) const { return (t == x.t ? id > x.id : t < x.t); }
	} a[N];
	LL n, m, v, k, d, pr[N], rs[N]; pii b[N];
	LL calc(LL x) {
		int t = upper_bound(b + 1, b + 1 + m, pii((x + 1) * v, 1e9)) - b - 1;
		return pr[t];
	} 
	int main() {
		cin >> n >> m >> v >> k >> d;
		REP(i, 1, n) cin >> a[i].t >> a[i].h, a[i].id = i;
		REP(i, 1, m) cin >> b[i].fi >> b[i].se;
		sort(a + 1, a + 1 + n);
		sort(b + 1, b + 1 + m);
		REP(i, 1, m) pr[i] = pr[i - 1] + b[i].se;
		LL t = 1, r = k;
		REP(i, 1, n) {
			LL x = 0, w = calc(t - a[i].t);
			if (a[i].h <= w + r) {
				if (a[i].h <= w) {
					int p = lower_bound(pr + 1, pr + 1 + m, a[i].h) - pr;
					rs[a[i].id] = a[i].t + (b[i].fi + v - 1) / v - 1;
				}
				rs[a[i].id] = t, r -= max((a[i].h - w + d - 1) / d, 0LL);
				continue;
			}
			a[i].h -= r * d;
			DEP(j, 30, 0) {
				LL y = x + (1 << j);
				if (calc(y + t - a[i].t) + d * k * y < a[i].h) x += 1 << j;
			}
			x ++, t += x, r = max(k - (a[i].h - calc(x + t - a[i].t) - d * k * (x - 1) + d - 1) / d, 0LL);
			rs[a[i].id] = t;
		}
		REP(i, 1, n) cout << rs[i] << ' ';
		cout << '\n';
		return 0;
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int T = 1;
	while (T --) Milkcat::main();
	return 0;
}