#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
struct ModLong {
  static unsigned long long M;
  static long double INV_M;
  static void setM(unsigned long long m) { M = m; INV_M = 1.0L / M; }
  unsigned long long x;
  ModLong() : x(0ULL) {}
  ModLong(unsigned x_) : x(x_ % M) {}
  ModLong(unsigned long long x_) : x(x_ % M) {}
  ModLong(int x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModLong(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModLong &operator+=(const ModLong &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModLong &operator-=(const ModLong &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModLong &operator*=(const ModLong &a) {
    // https://github.com/kth-competitive-programming/kactl/blob/main/doc/modmul-proof.pdf
    // This works at least for M < 2^62, assuming the usual 80-bit long double.
    const long long y = x * a.x - M * static_cast<unsigned long long>(INV_M * x * a.x);
    x = (y < 0LL) ? (y + M) : (y >= static_cast<long long>(M)) ? (y - M) : y;
    return *this;
  }
  ModLong &operator/=(const ModLong &a) { return (*this *= a.inv()); }
  ModLong pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModLong a = *this, b = 1ULL; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModLong inv() const {
    unsigned long long a = M, b = x; long long y = 0, z = 1;
    for (; b; ) { const unsigned long long q = a / b; const unsigned long long c = a - q * b; a = b; b = c; const long long w = y - static_cast<long long>(q) * z; y = z; z = w; }
    assert(a == 1ULL); return ModLong(y);
  }
  ModLong operator+() const { return *this; }
  ModLong operator-() const { ModLong a; a.x = x ? (M - x) : 0ULL; return a; }
  ModLong operator+(const ModLong &a) const { return (ModLong(*this) += a); }
  ModLong operator-(const ModLong &a) const { return (ModLong(*this) -= a); }
  ModLong operator*(const ModLong &a) const { return (ModLong(*this) *= a); }
  ModLong operator/(const ModLong &a) const { return (ModLong(*this) /= a); }
  template <class T> friend ModLong operator+(T a, const ModLong &b) { return (ModLong(a) += b); }
  template <class T> friend ModLong operator-(T a, const ModLong &b) { return (ModLong(a) -= b); }
  template <class T> friend ModLong operator*(T a, const ModLong &b) { return (ModLong(a) *= b); }
  template <class T> friend ModLong operator/(T a, const ModLong &b) { return (ModLong(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModLong &a) const { return (x == a.x); }
  bool operator!=(const ModLong &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModLong &a) { return os << a.x; }
};
unsigned long long ModLong::M;
long double ModLong::INV_M;
// !!!Use ModLong::setM!!!
////////////////////////////////////////////////////////////////////////////////

using Mint = ModLong;


constexpr Int K = 100;
constexpr Int LIM = 1001001001001001LL;

Int F0, G0, M;
int T;
vector<Int> N;

int main() {
  for (; ~scanf("%lld%lld%d%lld", &F0, &G0, &T, &M); ) {
    N.resize(T);
    for (int t = 0; t < T; ++t) {
      scanf("%lld", &N[t]);
    }
    Mint::setM(M);
    
    vector<Int> F(K + 1), G(K + 1);
    F[0] = F0;
    G[0] = G0;
    for (Int n = 1; n <= K; ++n) {
      F[n] = max(n, G[n/2] + G[n/3] + G[n/5] + G[n/7]);
      G[n] = max(n, F[n/2] + F[n/3] + F[n/4] + F[n/5]);
    }
// cerr<<"F = "<<F<<endl;
// cerr<<"G = "<<G<<endl;
    
    vector<Int> ns;
    vector<Mint> fs, gs;
    priority_queue<Int, vector<Int>, greater<Int>> que;
    auto add = [&](Int n, Mint f, Mint g) -> void {
      ns.push_back(n);
      fs.push_back(f);
      gs.push_back(g);
      for (const Int d : {2, 3, 5, 7}) {
        que.push(d * n);
      }
    };
    auto getF = [&](Int n) -> Mint {
      const int pos = upper_bound(ns.begin(), ns.end(), n) - ns.begin() - 1;
      return fs[pos];
    };
    auto getG = [&](Int n) -> Mint {
      const int pos = upper_bound(ns.begin(), ns.end(), n) - ns.begin() - 1;
      return gs[pos];
    };
    
    for (Int n = 0; n <= K; ++n) {
      if (n == 0 || F[n - 1] != F[n] || G[n - 1] != G[n]) {
        add(n, F[n], G[n]);
      }
    }
    for (; ; ) {
      const Int n = que.top();
      que.pop();
      if (n > LIM) {
        break;
      }
      if (ns.back() < n) {
        const Mint f = getG(n/2) + getG(n/3) + getG(n/5) + getG(n/7);
        const Mint g = getF(n/2) + getF(n/3) + getF(n/4) + getF(n/5);
        add(n, f, g);
      }
    }
    
    for (int t = 0; t < T; ++t) {
      const Mint f = getF(N[t]);
      const Mint g = getG(N[t]);
      printf("%llu %llu\n", f.x, g.x);
    }
  }
  return 0;
}