#include <bits/stdc++.h>
using namespace std;

typedef pair<long long, long long> PP;

vector<PP> F(1000000, {0,0}), G(1000000, {0,0});
long long M;

PP SUM(PP A, PP B, PP C, PP D) {
    PP X;
    X.first = A.first + B.first + C.first + D.first;
    X.second = A.second + B.second + C.second + D.second;
    X.first += X.second / M;
    X.second %= M;
    return X;
}

PP MAX(PP A, PP B) {
    if (A.first < B.first) return B;
    else if (A.first > B.first) return A;
    if (A.second < B.second) return B;
    else return A;
}

PP Zero = {0LL, 0LL};

PP DFS(map<long long, PP>& mp1, map<long long, PP>& mp2, long long N, int i) {
    if (N < 1000000) {
        if (i == 0) return F[N];
        else return G[N];
    }
    PP P = {0LL, N};
    if (i == 0) {
        if (mp1[N] != Zero) return mp1[N];
        else return mp1[N] = MAX(P, SUM(DFS(mp1, mp2, N/2, 1), DFS(mp1, mp2,N/3,1), DFS(mp1,mp2,N/5,1), DFS(mp1,mp2,N/7,1)));
    }
    else {
        if (mp2[N] != Zero) return mp2[N];
        else return mp2[N] = MAX(P, SUM(DFS(mp1, mp2, N/2, 0), DFS(mp1, mp2,N/3,0),DFS(mp1,mp2,N/4,0),DFS(mp1,mp2,N/5,0)));
    }
}

int main() {
    int T;
    cin >> F[0].second >> G[0].second >> T >> M;
    for (long long i = 1; i < 1000000; i++) {
        F[i] = MAX({0, i}, SUM(G[i/2],G[i/3],G[i/5],G[i/7]));
        G[i] = MAX({0, i}, SUM(F[i/2],F[i/3],F[i/4],F[i/5]));
    }
    for (int i = 0; i < T; i++) {
        long long X;
        cin >> X;
        map<long long, PP> mp1, mp2;
        cout << DFS(mp1, mp2, X, 0).second << ' ' << DFS(mp1, mp2, X, 1).second << endl;
    }
}