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

ll M,f0,g0;

map<ll,ll> f,g;

ll lim=1e15;

ll G(ll m);
ll F(ll m){
	if(m==0)return f0;
	if(!f.count(m)){
		ll val=max(m,G(m/2)+G(m/3)+G(m/5)+G(m/7));
		if(val>=lim)val=lim+val%lim;
		return f[m]=val;
	}
	return f[m];
}

ll G(ll m){
	if(m==0)return g0;
	if(!g.count(m)){
		ll val=max(m,F(m/2)+F(m/3)+F(m/4)+F(m/5));
		if(val>=lim)val=lim+val%lim;
		return g[m]=val;
	}
	return g[m];
}

int main(){
	int t;
	scanf("%lld %lld %i %lld",&f0,&g0,&t,&M);
	lim=(lim/M+1)*M;
	while(t--){
		ll m;
		scanf("%lld",&m);
		printf("%lld %lld\n",F(m)%M,G(m)%M);
	}
	return 0;
}