#include<bits/stdc++.h>
#define int long long 
using namespace std;
const int N=1e6+100,inf=1e15;
int t,mod;
int f[N],g[N],ff[N],gg[N];
vector<int>vt;
int q(int x)
{
	int it=lower_bound(vt.begin(),vt.end(),x)-vt.begin();
	if(vt[it]!=x)return N-1;else return it;
}
signed main()
{
	cin>>f[0]>>g[0]>>t>>mod;
	vt.push_back(0);
	for(int i=1;i<=13;i++)
		f[i]=max(i,g[i/2]+g[i/3]+g[i/5]+g[i/7]),
		g[i]=max(i,f[i/2]+f[i/3]+f[i/4]+f[i/5]),
		ff[i]=f[i]-f[i-1],gg[i]=g[i]-g[i-1],vt.push_back(i);
	for(int i=0;i<=13;i++)f[i]=f[i]%mod,g[i]=g[i]%mod,ff[i]=ff[i]%mod,gg[i]=gg[i]%mod;
	for(int i=1;i<=13;i++)for(int w1=i;w1<=inf;w1*=2)for(int w2=w1;w2<=inf;w2*=3)
		for(int w3=w2;w3<=inf;w3*=5)for(int w4=w3;w4<=inf;w4*=7)
			vt.push_back(w4);
	sort(vt.begin(),vt.end());vt.erase(unique(vt.begin(),vt.end()),vt.end());
	for(int i=14;i<vt.size();i++)
	{
		int t2=vt[i]%2?N-1:q(vt[i]/2),t3=vt[i]%3?N-1:q(vt[i]/3),
			   t4=vt[i]%4?N-1:q(vt[i]/4),t5=vt[i]%5?N-1:q(vt[i]/5),
			   t7=vt[i]%7?N-1:q(vt[i]/7);
		ff[i]=(gg[t2]+gg[t3]+gg[t5]+gg[t7])%mod;
		gg[i]=(ff[t2]+ff[t3]+ff[t4]+ff[t5])%mod;
		f[i]=(f[i-1]+ff[i])%mod,g[i]=(g[i-1]+gg[i])%mod;
	}
	while(t--)
	{
		int x;cin>>x;int it=upper_bound(vt.begin(),vt.end(),x)-vt.begin()-1;
		cout<<f[it]<<' '<<g[it]<<endl;
	}
	return 0;
}