#include <bits/stdc++.h>
using namespace std;
long long n, m, a, q, an[1001000], mod, jc[1001000] = {0}, ny[1001000] = {0},
                                        sc[1001000] = {0};
long long K(long long x, long long y) {
  long long z = 1;
  for (; y; y >>= 1) {
    if (y & 1) {
      z = (z * x) % mod;
    }
    x = (x * x) % mod;
  }
  return z;
}
long long C(long long x, long long y) {
  if (x < y) return 0;
  return jc[x] * ny[x - y] % mod * ny[y] % mod;
}
int main() {
  cin >> n >> m >> a >> q;
  an[0] = 1;
  for (an[mod = 1] = a; 1;) {
    a = (an[++mod] = a * an[1] % q);
    if (a == 1) break;
  }
  long long mx = min(1000000ll, mod - 1);
  jc[0] = 1;
  for (long long i = 1; i <= mx; i++) {
    jc[i] = jc[i - 1] * i % mod;
  }
  ny[mx] = K(jc[mx], mod - 2);
  for (long long i = mx - 1; i >= 0; i--) {
    ny[i] = (ny[i + 1] * (i + 1)) % mod;
  }
  for (long long i = 0; i <= n; i++) {
    sc[i] = C(m, i);
  }
  for (long long i = 1; i <= n; i++) {
    sc[i] = (sc[i - 1] + sc[i]) % mod;
  }
  for (long long i = 1; i <= n; i++) {
    printf("%I64d ", an[sc[n - i]]);
  }
}
