//某位高人告诉我们：段数很小。
//发现 x 相对 x-1 的变化是因为 x 是某个数的倍数
//差值就是在 x/y 处的差值

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

const int N = 1e15, M = 1e6 + 10;
int f[M], g[M], mod, x[M], y[M], z[M], cur;
map<int,int>wf,wg;
set<int>S;

signed main()
{
	int t, i, i2, i3, i5, i7;cin>>f[0]>>g[0]>>t>>mod;
	S.insert(0), wf[0] = f[0], wg[0] = g[0];
	for(i=1;i<=13;i++)
	{
		S.insert(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]);
		wf[i] = (f[i] - f[i-1] + mod) % mod, wg[i] = (g[i] - g[i-1]) % mod;
		for(i2=1;i*i2<=N;i2*=2) for(i3=1;i*i2*i3<=N;i3*=3)
			for(i5=1;i*i2*i3*i5<=N;i5*=5) for(i7=1;i*i2*i3*i5*i7<=N;i7*=7)
				S.insert(i*i2*i3*i5*i7);
	}
	for(auto i:S) if(i>13)
	{
		wf[i] = (((i%2)?0:wg[i/2])+((i%3)?0:wg[i/3])+((i%5)?0:wg[i/5])+((i%7)?0:wg[i/7]))%mod;
		wg[i] = (((i%2)?0:wf[i/2])+((i%3)?0:wf[i/3])+((i%4)?0:wf[i/4])+((i%5)?0:wf[i/5]))%mod;
	}
	for(auto i:S)
		x[++cur] = i, y[cur] = (y[cur-1] + wf[i]) % mod, z[cur] = (z[cur-1] + wg[i]) % mod;
	while(t--)
	{
		int a;cin>>a;
		int p = upper_bound(&x[1],&x[cur]+1,a) - x - 1;
		cout<<y[p]<<' '<<z[p]<<'\n';
	}
	return 0;
}