#include <bits/stdc++.h>

using LL = long long;

constexpr int h[] = {2, 3, 5, 7};
constexpr LL M = (LL)(1e15) + 15;

int f0, g0, T; LL mod;

std::vector<LL> vals, f, g;
void dfs(int i, LL v) {
    if (i == 4) {
        vals.push_back(v);
        return;
    }
    for (int j = 0; v < M; j++, v *= h[i])
        dfs(i + 1, v);
}
LL query_f(LL v) {
    int p = std::upper_bound(vals.begin(), vals.end(), v) - vals.begin() - 1;
    return f[p];
}
LL query_g(LL v) {
    int p = std::upper_bound(vals.begin(), vals.end(), v) - vals.begin() - 1;
    return g[p];
}

int main() {
    scanf("%d%d%d%lld", &f0, &g0, &T, &mod);
    vals.push_back(0);
    for (int i = 1; i <= 13; i++) dfs(0, i);
    std::sort(vals.begin(), vals.end());
    vals.resize(std::unique(vals.begin(), vals.end()) - vals.begin());
    f.resize(vals.size());
    g.resize(vals.size());
    f[0] = f0;
    g[0] = g0;
    for (int i = 1; i < vals.size(); i++) {
        LL t = vals[i];
        f[i] = (query_g(t / 2) + query_g(t / 3) + query_g(t / 5) + query_g(t / 7)) % mod;
        g[i] = (query_f(t / 2) + query_f(t / 3) + query_f(t / 4) + query_f(t / 5)) % mod;
        if (t <= 13) {
            f[i] = std::max(f[i], t);
            g[i] = std::max(g[i], t);
        }
    }
    while (T--) {
        LL n;
        scanf("%lld", &n);
        printf("%lld %lld\n", query_f(n) % mod, query_g(n) % mod);
    }
    return 0;
}