#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e7 + 5;
map<int, int> mp, bac;
int f[maxn], g[maxn], T, M;
vector<int> vec;
void dfs(int now) {
	if(now > 1000000000000000) return;
	if(mp[now]) return;
	mp[now] = 1;
	if(now > 13) vec.push_back(now);
	dfs(now * 2), dfs(now * 3), dfs(now * 5), dfs(now * 7);
}

void init() {
	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]);
	}
	for(int i = 13;i >= 1;i--) f[i] -= f[i - 1], g[i] -= g[i - 1];
	for(int i = 0;i <= 13;i++) vec.push_back(i);
	dfs(1);
	sort(vec.begin(), vec.end());
	for(int i = 0;i < vec.size();i++) bac[vec[i]] = i;
	for(int i = 0;i < vec.size();i++) {
		int X = vec[i];
		if(mp[X * 2] && X * 2 > 13) (f[bac[X * 2]] += g[i]) %= M, (g[bac[X * 2]] += f[i]) %= M;
		if(mp[X * 3] && X * 3 > 13) (f[bac[X * 3]] += g[i]) %= M, (g[bac[X * 3]] += f[i]) %= M;
		if(mp[X * 5] && X * 5 > 13) (f[bac[X * 5]] += g[i]) %= M, (g[bac[X * 5]] += f[i]) %= M;
		if(mp[X * 4] && X * 4 > 13) (g[bac[X * 4]] += f[i]) %= M;
		if(mp[X * 7] && X * 7 > 13) (f[bac[X * 7]] += g[i]) %= M;	
	}
	for(int i = 1;i < vec.size();i++) (f[i] += f[i - 1]) %= M, (g[i] += g[i - 1]) %= M;
}
void solve() {
	int n;
	cin >> n;
	int P = upper_bound(vec.begin(), vec.end(), n) - vec.begin() - 1;
	cout << f[P] % M << " " << g[P] % M << '\n';
}
signed main() {
//	ios::sync_with_stdio(0);
//	cin.tie(0), cout.tie(0);
	cin >> f[0] >> g[0] >> T >> M;
	init();
	while(T --) solve();
}