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

bool debug=false;

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(x==0 || y==0)return 0;
	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){
	if(debug)printf("Recalc %i\n",i);
	if(tme[i]!=inf)all.erase({tme[i],i});
	bool first=false;
	if(alive.begin()->second==i)first=true;
	if(debug)printf("Is first: %i\n",first);
	ll bot=t[i],top=lim,ans=inf;
	while(top>=bot){
		ll mid=top+bot>>1;
		if(debug)printf("mid:%lld\n",mid);
		int j=upper_bound(offs+1,offs+1+m,mid-t[i])-offs-1;
		if(debug)printf("j:%i\n",j);
		ll hpLoss=sum[j];
		if(first){
			ll st=max(start,(ll)t[i]-1);
			if(debug)printf("st:%lld\n",st);
			if(mid>st)hpLoss+=ML(ML((mid-st),K),D);
			if(debug)printf("hpLoss1: %lld amo:%lld\n",hpLoss,amo);
			if(mid>=start && start>=t[i])hpLoss+=ML(amo,D);
			if(debug)printf("hpLoss2: %lld\n",hpLoss);
		}
		if(debug)printf("hpLoss: %lld\n",hpLoss);
		if(hpLoss>=h[i]){
			top=mid-1;
			ans=mid;
		}else{
			bot=mid+1;
		}
	}
	if(debug)printf("Calc i:%i ans:%lld\n",i,ans);
	tme[i]=ans;
	if(ans!=inf){
		all.insert({tme[i],i});
	}
}
ll ans[N];

typedef pair<int,int>pii;
vector<int>brute(){

    vector<int>pt(n+1),ph(n+1),pp(m+1),pa(m+1),pos(n+1),rez(n+1);

    for(int i=1;i<=n;i++){
        pt[i]=t[i];
        ph[i]=h[i];
        pos[i]=-1;
    }
    for(int i=1;i<=m;i++){
        pp[i]=p[i];
        pa[i]=a[i];
    }

    int alive=n;
    for(int x=1;alive;x++){

        vector<pii>cand;
        for(int j=1;j<=n;j++){
            if(pt[j]==x)pos[j]=0;
            if(pos[j]==-1)continue;
            for(int k=1;k<=m;k++){
                //printf("%d | %d %d %d\n",x,pos[j],pos[j]+x,pp[k]);
                if(pp[k]>pos[j] && pp[k]<=pos[j]+V){
                    ph[j]-=pa[k];
                    //printf("%d %d SKINO\n",x,k);
                }
            }
            if(ph[j]<=0){
                rez[j]=x;
                //printf("%d %d AA\n",j,x);
                pos[j]=-1;
                alive--;
            }

            if(pos[j]!=-1){
                pos[j]+=V;
                cand.pb({pos[j],-j});
            }
        }

        sort(cand.begin(),cand.end());

        for(int i=1;i<=K;i++){
            if(cand.size()==0)break;

            int id=-cand.back().ss;
            ph[id]-=D;
            if(ph[id]<=0){
                cand.pop_back();
                pos[id]=-1;
                rez[id]=x;
                alive--;
                //printf("%d %d AAFF\n",id,x);
            }

        }

        //printf("%d %d %d AFA\n",x,ph[1],pos[1]);

    }

    return rez;

}

void Solve(){
	alive.clear();
	all.clear();
	for(int i=1;i<=n;i++){
		alive.insert({t[i],i});
		tme[i]=inf;
	}
	for(int i=1;i<=m;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());
		if(debug)printf("i:%i ans:%lld\n",i,ans[i]);
		bool first=alive.begin()->second==i;
		if(debug)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);
			if(debug)printf("have:%lld need:%lld\n",have,need);
			amo=min(have-need,K);
			start=ans[i];
		}
		if(debug)printf("start:%lld amo:%lld\n",start,amo);
		if(first){
			if(alive.size()){
				Recalc(alive.begin()->second);
			}
		}
	}

}

mt19937 rng(time(0));
void Gen(){
	n=2;
	m=rng()%5+1;
	V=5;
	K=3;
	D=2;
	int mx=10;
	for(int i=1;i<=n;i++){
		t[i]=rng()%mx+1;
		h[i]=rng()%mx+1;
	}
	for(int i=1;i<=m;i++){
		p[i]=rng()%mx+1;
		a[i]=rng()%mx+1;
	}
}

void Test(){
	for(int test=0;test<100000;test++){
		Gen();
			printf("%i %i %lld %lld %lld\n",n,m,V,K,D);
			for(int i=1;i<=n;i++)printf("%i %i\n",t[i],h[i]);
			for(int i=1;i<=m;i++)printf("%i %i\n",p[i],a[i]);

		printf("Doing brute\n");
		vector<int>bbb=brute();
		printf("Doing solve\n");
		Solve();
		bool ok=true;
		for(int i=1;i<=n;i++)if(ans[i]!=bbb[i])ok=false;
		if(!ok){
			printf("%i %i %lld %lld %lld\n",n,m,V,K,D);
			for(int i=1;i<=n;i++)printf("%i %i\n",t[i],h[i]);
			for(int i=1;i<=m;i++)printf("%i %i\n",p[i],a[i]);
			printf("Brute: ");for(int i=1;i<=n;i++)printf("%i ",bbb[i]);printf("\n");
			printf("Solve: ");for(int i=1;i<=n;i++)printf("%lld ",ans[i]);printf("\n");
			exit(0);
		}
		printf("Test %i passed\n",test);
	}
}

int main(){

    ///freopen("test2.txt","r",stdin);
    //Test();
    //return 0;

	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]);
	}
	for(int i=1;i<=m;i++){
		scanf("%i %i",&p[i],&a[i]);
	}

	//vector<int>bbb=brute();
	//for(int i=1;i<=n;i++)printf("%d ",bbb[i]);
	//printf("\n");

	Solve();
	for(int i=1;i<=n;i++){
        /*if(ans[i]!=bbb[i]){
            printf("%lld %d\n",ans[i],bbb[i]);
        }*/
        printf("%lld ",ans[i]);
	}
	return 0;
}