#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
using namespace std;

using vi = vector<int>;

constexpr int S = 1 << 4;
constexpr int N = 4e5 + 9;
constexpr LL M = 1e15 + 7;
int T, X, Y;
LL P;

unordered_map<LL, LL> f, g;

int t;
LL a[N];

int main () {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> X >> Y >> T >> P;
  f[0] = X % P;
  g[0] = Y % P;
  L (i, 1, S) {
    f[i] = max((LL)i, g[i / 2] + g[i / 3] + g[i / 5] + g[i / 7]) % P;
    g[i] = max((LL)i, f[i / 2] + f[i / 3] + f[i / 4] + f[i / 5]) % P;
  }
  R (i, N - 1, 1) {
    f[i] = (f[i] - f[i - 1] + P) % P;
    g[i] = (g[i] - g[i - 1] + P) % P;
  }
  L (o, 1, 13) {
    for (LL i = 1; i < M; i *= 2) {
      LL x = o * i;
      for (LL j = 1; x * j < M; j *= 3) {
        LL y = x * j;
        for (LL k = 1; y * k < M; k *= 5) {
          LL z = y * k;
          for (LL l = 1; z * l < M; l *= 7) {
            LL v = z * l;
            if (v > S) {
              a[++t] = v;
            }
          }
        }
      }
    }
  }
  sort(a + 1, a + t + 1);
  t = unique(a + 1, a + t + 1) - a - 1;
  L (i, 1, t) {
    LL x = a[i];
    f[x] = (x % 2 == 0 ? g[x / 2] : 0) + (x % 3 == 0 ? g[x / 3] : 0) + (x % 5 == 0 ? g[x / 5] : 0) + (x % 7 == 0 ? g[x / 7] : 0);
    g[x] = (x % 2 == 0 ? f[x / 2] : 0) + (x % 3 == 0 ? f[x / 3] : 0) + (x % 4 == 0 ? f[x / 4] : 0) + (x % 5 == 0 ? f[x / 5] : 0);
    f[x] %= P;
    g[x] %= P;
  }
  L (i, 1, S) {
    (f[i] += f[i - 1]) %= P;
    (g[i] += g[i - 1]) %= P;
  }
  a[0] = S;
  L (i, 1, t) {
    (f[a[i]] += f[a[i - 1]]) %= P;
    (g[a[i]] += g[a[i - 1]]) %= P;
  }
  while (T--) {
    LL v;
    cin >> v;
    if (v <= S) {
      cout << f[v] << ' ' << g[v] << '\n';
    } else {
      int p = upper_bound(a + 1, a + t + 1, v) - a - 1;
      cout << f[a[p]] << ' ' << g[a[p]] << '\n';
    } 
  }
}
// I love WHQ!