#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+10;
const ll Max=1e15;
ll f[N],g[N],F[N],G[N],mod,L[N],tot;
ll getg(ll x,int y){
    if(x%y)return 0;
    // if(x==14)cout<<y<<"\n";
    int id=lower_bound(L+1,L+1+tot,x/y)-L;
    return G[id];
}
ll getf(ll x,int y){
    if(x%y)return 0;
    int id=lower_bound(L+1,L+1+tot,x/y)-L;
    return F[id];
}
void init(){
    for(int i=1;i<=13;i++){
        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]);
        F[i]=f[i]-f[i-1],G[i]=g[i]-g[i-1];
        // cout<<f[i]<<" "<<g[i]<<"\n";
    }
    set<ll>st;
    for(int i=1;i<=13;i++)for(ll i2=1;(ll)i*i2<=Max;i2<<=1)for(ll i3=1;(ll)i*i2*i3<=Max;i3*=3)
    for(ll i5=1;(ll)i*i2*i3*i5<=Max;i5*=5)for(ll i7=1;(ll)i*i2*i3*i5*i7<=Max;i7*=7){
        st.insert((ll)i*i2*i3*i5*i7);
    }
    // cout<<"*";
    for(ll x:st){
        L[++tot]=x;if(x<=13)continue;
        // if(x<=20)cout<<x<<"\n";
        F[tot]=(getg(x,2)+getg(x,3)+getg(x,5)+getg(x,7))%mod;f[tot]=(f[tot-1]+F[tot])%mod;
        G[tot]=(getf(x,2)+getf(x,3)+getf(x,4)+getf(x,5))%mod;g[tot]=(g[tot-1]+G[tot])%mod;
        
    }
}
int main() {
    int t;
    scanf("%lld%lld%d%lld",&f[0],&g[0],&t,&mod);
    init();
    while(t--){
        ll x;scanf("%lld",&x);
        int id=upper_bound(L+1,L+1+tot,x)-L-1;
        // cout<<F[id]<<"\n";
        printf("%lld %lld\n",f[id],g[id]);
    }
    return 0;
}