//test
#include<bits/stdc++.h>
using namespace std;
long long N=1e15;
long long f[15],g[15],mod;
map<long long,int>mp;
map<long long,long long>cf,cg;
void suan(long long x){
	cf[x]=((x%2?0:cg[x/2])+(x%3?0:cg[x/3])+(x%5?0:cg[x/5])+(x%7?0:cg[x/7]))%mod;
	cg[x]=((x%2?0:cf[x/2])+(x%3?0:cf[x/3])+(x%4?0:cf[x/4])+(x%5?0:cf[x/5]))%mod;
}
long long a1[1000005],a2f[1000005],a2g[1000005];
int main(){
	int T;
	scanf("%lld%lld%d%lld",&f[0],&g[0],&T,&mod);
	for(int i=1;i<=13;++i){
		f[i]=max(0ll+i,g[i/2]+g[i/3]+g[i/5]+g[i/7]);
		g[i]=max(0ll+i,f[i/2]+f[i/3]+f[i/4]+f[i/5]);
	}
	int tt=0;
	for(int i=1;i<=13;++i){
		cf[i]=(f[i]-f[i-1]%mod+mod)%mod;cg[i]=(g[i]-g[i-1]%mod+mod)%mod;
		for(long long c1=1;i*c1<=N;c1*=2)
			for(long long c2=1;i*c1*c2<=N;c2*=3)
				for(long long c3=1;i*c1*c2*c3<=N;c3*=5)
					for(long long c4=1;i*c1*c2*c3*c4<=N;c4*=7){
						long long x=i*c1*c2*c3*c4;
						if(!mp[x])mp[x]=++tt;
					}
	}
	for(auto pi:mp)if(pi.first>13)suan(pi.first);
	long long hf=f[0],hg=g[0];
	int zg=0;
	for(auto pi:mp){
		long long x=pi.first;
		a1[++zg]=x;
		hf=(hf+cf[x])%mod,hg=(hg+cg[x])%mod;
		a2f[zg]=hf,a2g[zg]=hg;
	}
	while(T--){
		long long m;
		scanf("%lld",&m);
		int wz=upper_bound(a1+1,a1+zg+1,m)-a1-1;
		printf("%lld %lld\n",a2f[wz],a2g[wz]);
	}
	return 0;
}