#include "bits/stdc++.h"
#ifdef DEBUG
#include "PrettyDebug.hpp"
#else
#define debug(...) [](auto...){}(__VA_ARGS__)
#define debuga(...) [](auto...){}(__VA_ARGS__)
#endif
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
using namespace std; typedef long long ll;
constexpr ll LIM=1e15;
ll mod; map<ll,ll> F,G;
void ck(ll& x,ll y) { x+=y-mod; x+=(x>>31)&mod; }
signed main(){
    atexit([](){cerr<<"Time = "<<clock()<<" ms"<<endl;});
    ios::sync_with_stdio(0); cin.tie(0);
    ll f0,g0,T; cin>>f0>>g0>>T>>mod;
    ll f[15]={f0},g[15]={g0};
    For(i,1,14){
        f[i]=max(1ll*i,g[i/2]+g[i/3]+g[i/5]+g[i/7]);
        g[i]=max(1ll*i,f[i/2]+f[i/3]+f[i/4]+f[i/5]);
    }
    For(i,0,14) f[i]%=mod,g[i]%=mod;
    F[0]=f0,G[0]=g0; For(i,1,14) F[i]=((f[i]-f[i-1])%mod+mod)%mod,G[i]=((g[i]-g[i-1])%mod+mod)%mod;
    For(i,1,14){
        for(ll x2=i;x2<=LIM;x2*=2){
            for(ll x3=x2;x3<=LIM;x3*=3){
                for(ll x4=x3;x4<=LIM;x4*=5){
                    for(ll x5=x4;x5<=LIM;x5*=7){
                        if(F.count(x5)) continue;
                        #pragma GCC unroll(4)
                        for(int o:{2,3,5,7}) if(x5%o==0) ck(F[x5],G[x5/o]);
                        #pragma GCC unroll(4)
                        for(int o:{2,3,4,5}) if(x5%o==0) ck(G[x5],F[x5/o]);
                    }
                }
            }
        }
    }
    ll lst=0; for(auto& [x,y]:F) ck(y,lst),lst=y;
       lst=0; for(auto& [x,y]:G) ck(y,lst),lst=y;
    while(T--){
        ll x; cin>>x; cout<<(--F.upper_bound(x))->second<<' '<<(--G.upper_bound(x))->second<<'\n';
    }
    return 0;
}

// CONTINUE, NON-STOPPING, FOR CHARLIEY
// START TYPING IF YOU DON'T KNOW WHAT TO DO
// STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING

// Started Coding On: February 15 Thu, 18 : 37 : 30