#include<iostream>
#include<cstdio>
#include<set>
#include<map>
#define N 21
#define M 1000000
using namespace std;
const long long inf=(long long)(1e15);
long long read()
{
	char c=0;
	long long sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	long long num;
	int type;
	bool operator < (const reads &t)const
    {
		return num!=t.num?num<t.num:type<t.type;	
	}
};
set<reads>s;
map<reads,__int128>dp;
struct rds
{
	long long num;
	__int128 data;
	bool operator < (const rds &t)const
	{
		return num<t.num;
	}
};
rds tong[M+1],tong2[M+1];
int T,length,length2;
long long f[N+1],g[N+1],delta[M+1],delta2[M+1],mod;
reads operator * (reads a,int d)
{
	return (reads){a.num*d,a.type^1};
}
void bfs()
{
	reads top;
	set<reads>s;
	for (int i=0;i<=20;++i)
	{
		if (f[i]!=(i?f[i-1]:0)) dp[(reads){i,0}]=f[i]-(i?f[i-1]:0),s.insert((reads){i,0});
		if (g[i]!=(i?g[i-1]:0)) dp[(reads){i,1}]=g[i]-(i?g[i-1]:0),s.insert((reads){i,1});
	}
	while (!s.empty())
	{
		top=(*s.begin()),s.erase(s.begin());
		if (!top.type) tong[++length]=(rds){top.num,dp[top]};
		else tong2[++length2]=(rds){top.num,dp[top]};
		if (!top.type)
		{
			if ((top*2).num>=21&&(top*2).num<=inf) dp[top*2]+=dp[top],s.insert(top*2);
			if ((top*3).num>=21&&(top*3).num<=inf) dp[top*3]+=dp[top],s.insert(top*3);
			if ((top*4).num>=21&&(top*4).num<=inf) dp[top*4]+=dp[top],s.insert(top*4);
			if ((top*5).num>=21&&(top*5).num<=inf) dp[top*5]+=dp[top],s.insert(top*5);
		}
		else
		{
			if ((top*2).num>=21&&(top*2).num<=inf) dp[top*2]+=dp[top],s.insert(top*2);
			if ((top*3).num>=21&&(top*3).num<=inf) dp[top*3]+=dp[top],s.insert(top*3);
			if ((top*5).num>=21&&(top*5).num<=inf) dp[top*5]+=dp[top],s.insert(top*5);
			if ((top*7).num>=21&&(top*7).num<=inf) dp[top*7]+=dp[top],s.insert(top*7);
		}
	}
	return;
}
int main()
{
	long long x;
	f[0]=read(),g[0]=read(),T=read(),mod=read();
	for (int i=1;i<=21;++i) f[i]=max((long long)(i),g[i/2]+g[i/3]+g[i/5]+g[i/7]),g[i]=max((long long)(i),f[i/2]+f[i/3]+f[i/4]+f[i/5]);
	bfs();
	for (int i=1;i<=length;++i) delta[i]=(delta[i-1]+tong[i].data)%mod;
	for (int i=1;i<=length2;++i) delta2[i]=(delta2[i-1]+tong2[i].data)%mod;
	for (int i=1;i<=T;++i) x=read(),printf("%lld %lld\n",delta[lower_bound(tong+1,tong+length+1,(rds){x+1,0})-tong-1],delta2[lower_bound(tong2+1,tong2+length2+1,(rds){x+1,0})-tong2-1]);
	return 0;
}