#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2000000, mod = 1e9 + 7;
int w[MAXN];
stack<int> s;
long long pot(long long co, long long wyk, long long mod) {
  long long w = 1;
  for (; wyk; wyk /= 2) {
    if (wyk % 2) w = (w * co) % mod;
    co = (co * co) % mod;
  }
  return w;
}
int main() {
  int a, b, c, d, e, n, k, m, q, ord, sum;
  scanf("%d%d%d%d", &n, &m, &a, &q);
  w[0] = 1;
  b = a % q;
  for (ord = 1; b != 1; ord++) {
    w[ord] = b;
    b = ((long long)b * a) % q;
  }
  b = m;
  c = 1;
  d = 1;
  sum = 0;
  for (; c <= n; c++) {
    sum += d;
    sum %= ord;
    s.push(w[sum]);
    d = (long long)d * b * pot(c, ord - 2, ord) % ord;
    b--;
  }
  for (; !s.empty(); s.pop()) printf("%d ", s.top());
  return 0;
}
