#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1000005;
const int inf=1e9;
inline ll rd()
{
	ll x=0; bool f=1;
	char ch=getchar();
	for(;ch<'0'||ch>'9';ch=getchar())
		if(ch=='-') f=0;
	for(;ch>='0'&&ch<='9';ch=getchar())
		x=x*10+(ch^48);
	return f?x:-x;
}
ll mod;
struct Node
{
	ll l,r;
	ll x;
	inline bool operator<(const Node t) const
	{ return r<t.r; }
};
set<Node> f,g;
inline Node fndf(ll x)
{
	return *f.lower_bound({0,x,0});
}
inline Node fndg(ll x)
{
	return *g.lower_bound({0,x,0});
}
int main()
{
	int f0=rd(),g0=rd(),t=rd();
	mod=rd();
	f.insert({0,0,f0%mod});
	g.insert({0,0,g0%mod});
	ll cnt=0;
	while((*f.rbegin()).r<=1e15||(*g.rbegin()).r<=1e15)
	{
		cnt++;
		if((*f.rbegin()).r<=(*g.rbegin()).r)
		{
			ll now=(*f.rbegin()).r+1;
			Node p=fndg(now/2);
			ll res=p.x;
			ll nr=(p.r+1)*2;
			p=fndg(now/3);
			res+=p.x;
			nr=min(nr,(p.r+1)*3);
			p=fndg(now/5);
			res+=p.x;
			nr=min(nr,(p.r+1)*5);
			p=fndg(now/7);
			res+=p.x;
			nr=min(nr,(p.r+1)*7);
			if(now<=11&&res<now)
				f.insert({now,now,now});
			else
			{
				if(now>11)
					res%=mod;
				f.insert({now,nr-1,res});
			}
		}
		else
		{
			ll now=(*g.rbegin()).r+1;
			Node p=fndf(now/2);
			ll res=p.x;
			ll nr=(p.r+1)*2;
			p=fndf(now/3);
			res+=p.x;
			nr=min(nr,(p.r+1)*3);
			p=fndf(now/4);
			res+=p.x;
			nr=min(nr,(p.r+1)*4);
			p=fndf(now/5);
			res+=p.x;
			nr=min(nr,(p.r+1)*5);
			if(now<=11&&res<now)
				g.insert({now,now,now});
			else
			{
				if(now>11)
					res%=mod;
				g.insert({now,nr-1,res});
			}
		}
	}
	while(t--)
	{
		ll x=rd();
		Node ff=fndf(x),gg=fndg(x);
		printf("%lld %lld\n",ff.x%mod,gg.x%mod);
	}
	return 0;
}