#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define uint unsigned int
ifstream fi("radixsort.in");
ofstream fo("radixsort.out");

#define BUFMAX 11000000
int bufcnt = BUFMAX - 1; char buf[BUFMAX];
inline void write(uint x) {
  buf[bufcnt--] = ' ';
  do buf[bufcnt--] = x % 10 + '0', x /= 10; while (x);
}
inline void flush() { fo.write(buf + bufcnt + 1, BUFMAX - bufcnt - 2); }

#define MAX 10000001
#define MASK 0xff
uint v[MAX], w[MAX], x[MASK + 1];

inline void radix(int n, uint v[], uint w[], int bit) {
  memset(x, 0, sizeof x);
  for (int i = 1; i <= n; i++) x[v[i] >> bit & MASK]++;
  for (int i = 1; i <= MASK; i++) x[i] += x[i - 1];
  for (int i = n; i > 0; i--) w[x[v[i] >> bit & MASK]--] = v[i];
}

int main() {
  int n; uint a, b, c; fi >> n >> a >> b >> c;
  v[1] = b; a %= c, b %= c;
  for (int i = 2; i <= n; i++) {
    unsigned long long t = a; t *= v[i - 1];
    v[i] = t % c; v[i] += b; v[i] -= (v[i] > c) * c;
  }
  radix(n, v, w, 0);
  radix(n, w, v, 8);
  radix(n, v, w, 16);
  radix(n, w, v, 24);
  for (int i = n - (n - 1) % 10; i > 0; i -= 10) write(v[i]); flush();
}