#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = (ll)mod17 * mod17;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
    vector<T> res;
    int ida = 0, idb = 0;
    while (ida < a.size() || idb < b.size()) {
        if (idb == b.size()) {
            res.push_back(a[ida]); ida++;
        }
        else if (ida == a.size()) {
            res.push_back(b[idb]); idb++;
        }
        else {
            if (a[ida] < b[idb]) {
                res.push_back(a[ida]); ida++;
            }
            else {
                res.push_back(b[idb]); idb++;
            }
        }
    }
    return res;
}
template<typename T>
void cinarray(vector<T>& v) {
    rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
    rep(i, v.size()) {
        if (i > 0)cout << " "; cout << v[i];
    }
    cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
    if (n < 0) {
        ll res = mod_pow(x, -n, m);
        return mod_pow(res, m - 2, m);
    }
    if (abs(x) >= m)x %= m;
    if (x < 0)x += m;
    //if (x == 0)return 0;
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
//mod should be <2^31
struct modint {
    int n;
    modint() :n(0) { ; }
    modint(ll m) {
        if (m < 0 || mod <= m) {
            m %= mod; if (m < 0)m += mod;
        }
        n = m;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    a = abs(a); b = abs(b);
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
    if (loc >= v.size())v.resize(loc + 1, 0);
    v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
    fill(isp + 2, isp + mn, true);
    for (int i = 2; i < mn; i++) {
        if (!isp[i])continue;
        ps.push_back(i);
        for (int j = 2 * i; j < mn; j += i) {
            isp[j] = false;
        }
    }
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    if (res == st.begin())return st.end();
    res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
    return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
    a = a + b; return a;
}
mP operator-(mP a, mP b) {
    return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
    a = a - b; return a;
}
LP operator+(LP a, LP b) {
    return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
    a = a + b; return a;
}
LP operator-(LP a, LP b) {
    return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
    a = a - b; return a;
}
P operator+(P a, P b) {
    return { a.first + b.first,a.second + b.second };
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//------------------------------------

const int zz = 23;
const int bb = 1 << zz;
ll mf[bb];
ll mg[bb];

const ll sup = INF / 10;
unordered_map<ll, ll> mpf, mpg;
vector<int> vf = { 2,3,5,7 };
vector<int> vg = { 2,3,4,5 };

vector<LP> ff[50];

void init() {
    for (int i = zz; i < 50; i++) {
        const int b = (1 << (i - zz + 1));
        map<ll, LP> mp;
        mp[1] = { 1,0 };
        while (true) {
            assert(mp.size());
            auto pp = *mp.begin(); 
            if (pp.first >= b)break;
            mp.erase(mp.begin());
            ll x = pp.first;
            ll cf = pp.second.first;
            ll cg = pp.second.second;
            if (cf > 0) {
                for (int c : vf) {
                    mp[x * c].second += cf;
                }
            }
            if (cg > 0) {
                for (int c : vg) {
                    mp[x * c].first += cg;
                }
            }
        }
        for (auto pp : mp) {
            ll x = pp.first;
            ll cf = pp.second.first;
            ll cg = pp.second.second;
            if (cg > 0) {
                for (int c : vg) {
                    mp[x * c].first += cg;
                }
            }
        }
        for (auto pp : mp) {
            ll x = pp.first;
            ll cf = pp.second.first;
            ll cg = pp.second.second;
            if (cf)ff[i].push_back({ x,cf });
        }

        //cout << i << " " << ff[i].size() << "\n";
    }
}

ll m;

ll calcf(ll x);
ll calcg(ll x);
ll calcf(ll x) {
    if (x < bb)return mf[x];
    if (mpf.find(x) != mpf.end())return mpf[x];
    ll res = 0;
    for (int d : vf)res += calcg(x / d);
    while (res >= m)res -= m;
    return mpf[x] = res;
}
ll calcg(ll x) {
    if (x < bb)return mg[x];
    if (mpg.find(x) != mpg.end())return mpg[x];
    ll res = 0;
    for (int d : vg)res += calcf(x / d);
    while (res >= m)res -= m;
    return mpg[x] = res;
}
void solve() {
    ll f0, g0; int T; cin >> f0 >> g0 >> T >> m;
    mf[0] = f0;
    mg[0] = g0;
    for (int x = 1; x < 1000; x++) {
        ll res = 0;
        for (int d : vf)res += mg[x / d];
        if (res > sup) {
            res -= ((res - sup) / m + 1) * m;
        }
        chmax(res, (ll)x);
        mf[x] = res;

        res = 0;
        for (int d : vg)res += mf[x / d];
        if (res > sup) {
            res -= ((res - sup) / m + 1) * m;
        }
        chmax(res, (ll)x);
        mg[x] = res;
    }
    rep(i, 1000) {
        mf[i] %= m;
        mg[i] %= m;
    }
    for (int x = 1000; x < bb; x++) {
        ll res = 0;
        for (int d : vf)res += mg[x / d];
        while (res >= m)res %= m;
        mf[x] = res;

        res = 0;
        for (int d : vg)res += mf[x / d];
        while (res >= m)res %= m;
        mg[x] = res;
    }
    rep(_, T) {
        ll ansf = 0, ansg = 0;
        ll x; cin >> x;
        if (x < bb) {
            ansf = mf[x], ansg = mg[x];
        }
        else {
            int chk = -1;
            per(i, 50) {
                if (x & (1ll << i)) {
                    chk = i; break;
                }
            }
            for (auto p : ff[chk]) {
                int loc = x / p.first;
                ansf += mf[loc] * p.second; ansf %= m;
                ansg += mg[loc] * p.second; ansg %= m;
            }
        }
        cout << ansf << " " << ansg << "\n";
    }
}

void expr() {
    const int ma = (1 << 26);
    set<ll> st;
    queue <ll> que; que.push(1);
    st.insert(1);
    vector<ll> cs = { 2,3,5,7 };
    while (!que.empty()) {
        ll v = que.front(); que.pop();
        for (ll c : cs) {
            if (v * c < ma) {
                if (!st.count(v * c)) {
                    st.insert(v * c);
                    que.push(v * c);
                }
            }
        }
    }
    cout << st.size() << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed<<setprecision(10);
    //init_f();
    init();
    //while(true)
    //expr();
    //expr2();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}