#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

int n,m;
ll V,K,D;
set<pair<int,int>> alive;
const int N=100050;
int t[N],h[N],p[N],a[N],ord[N];
ll sum[N],offs[N];

const ll inf=1e18;
ll ML(ll x,ll y){
	if(inf/x<y)return inf;
	return x*y;
}
const ll lim=2e14;
ll tme[N],start,amo;
set<pair<ll,int>> all;
void Recalc(int i){
	//printf("Recalc %i\n",i);
	if(tme[i]!=inf)all.erase({tme[i],i});
	bool first=false;
	if(alive.begin()->second==i)first=true;
	//printf("Is first: %i\n",first);
	ll bot=t[i],top=lim,ans=inf;
	while(top>=bot){
		ll mid=top+bot>>1;
		int j=upper_bound(offs+1,offs+1+m,mid-t[i])-offs-1;
		ll hpLoss=sum[j];
		if(first){
			ll st=max(start,(ll)t[i]-1);
			if(mid>st)hpLoss+=ML(ML((mid-st),K),D);
			if(mid>=start && start>=t[i])hpLoss+=ML(amo,D);
		}
		if(hpLoss>=h[i]){
			top=mid-1;
			ans=mid;
		}else{
			bot=mid+1;
		}
	}
	//printf("Calc i:%i ans:%lld\n",i,ans);
	tme[i]=ans;
	if(ans!=inf){
		all.insert({tme[i],i});
	}
}
ll ans[N];
int main(){
	scanf("%i %i %lld %lld %lld",&n,&m,&V,&K,&D);
	for(int i=1;i<=n;i++){
		scanf("%i %i",&t[i],&h[i]);
		alive.insert({t[i],i});
		tme[i]=inf;
	}
	for(int i=1;i<=m;i++){
		scanf("%i %i",&p[i],&a[i]);
		ord[i]=i;
	}
	start=0;
	amo=K;
	sort(ord+1,ord+1+m,[&](int i,int j){return p[i]<p[j];});
	for(int i=1;i<=m;i++){
		sum[i]=sum[i-1]+a[ord[i]];
		offs[i]=(p[ord[i]]+V-1)/V-1;
	}
	for(int i=1;i<=n;i++)Recalc(i);
	while(all.size()){
		int i=all.begin()->second;
		ans[i]=all.begin()->first;
		all.erase(all.begin());
		//printf("i:%i ans:%lld\n",i,ans[i]);
		bool first=alive.begin()->second==i;
		//printf("first:%i\n",first);
		alive.erase({t[i],i});
		if(first){
			int j=upper_bound(offs+1,offs+1+m,ans[i]-t[i])-offs-1;
			ll H=h[i]-sum[j];
			ll have=0;
			ll st=max(start,(ll)t[i]-1);
			if(ans[i]>st)have+=ML((ans[i]-st),K);
			if(ans[i]>=start && start>=t[i])have+=amo;
			ll need=max((H+D-1)/D,(ll)0);
			amo=have-need;
			start=ans[i];
		}
		//printf("start:%lld amo:%lld\n",start,amo);
		if(first){
			if(alive.size()){
				Recalc(alive.begin()->second);
			}
		}
	}
	for(int i=1;i<=n;i++)printf("%lld ",ans[i]);
	return 0;
}