#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define i128 __int128
using namespace std; 
const int N = 1e6 + 7;
const ll mxm = 1e15;
ll mod;
int q; 
ll f[N], g[N];
int df[4] = {2, 3, 5, 7};
int dg[4] = {2, 3, 4, 5};
ll arr[N];
int tot;
unordered_map < ll, int > mp;
unordered_set < ll > st;
void dfs(ll x) {
	if(x > mxm)return;
	if(st.count(x))return;
	arr[++tot] = x;
	st.insert(x);
	dfs(x * 2);
	dfs(x * 3);
	dfs(x * 5);
	dfs(x * 7);
}
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> f[0] >> g[0] >> q >> mod;
	L(i, 1, 11) {
		f[i] = max((ll)i, g[i / 2] + g[i / 3] + g[i / 5] + g[i / 7]);
		g[i] = max((ll)i, f[i / 2] + f[i / 3] + f[i / 4] + f[i / 5]);
	}
	L(i, 0, 11) f[i] %= mod;
	L(i, 1, 12) dfs(i);
	R(i, 11, 0) {
		f[i + 1] -= f[i]; 
		g[i + 1] -= g[i];
	}
	L(i, 1, 12) {
		f[i] = (f[i] % mod + mod) % mod;
		g[i] = (g[i] % mod + mod) % mod;
	}
	sort(arr + 1, arr + tot + 1);
	L(i, 1, tot) mp[arr[i]] = i;
	L(i, 0, tot) {
		L(j, 0, 3) {
			ll go = arr[i] * dg[j];
			go = max(go, 12LL);
			if(go <= mxm) {
				(g[mp[go]] += f[i]) %= mod;
			}
		}
		
		L(j, 0, 3) {
			ll go = arr[i] * df[j];
			go = max(go, 12LL);
			if(go <= mxm) {
				(f[mp[go]] += g[i]) %= mod;
			}
		}
	}
	L(i, 1, tot) {
		(f[i] += f[i - 1]) %= mod;
		(g[i] += g[i - 1]) %= mod;
	}
	
	while(q--) {
		ll m;
		cin >> m;
		int pos = upper_bound(arr + 1, arr + tot + 1, m) - arr - 1;
		cout << f[pos] << " " << g[pos] << '\n';
	}
	return 0;
}