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

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

#define MAX 10000000
int v[MAX], w[MAX], x[0x800];

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

int main() {
  int n, a, b, c; fi >> n >> a >> b >> c;
  v[0] = b; for (int i = 1; i < n; i++) v[i] = (1LL * a * v[i - 1] + b) % c;
  radix(n, v, w, 0);
  radix(n, w, v, 11);
  radix(n, v, w, 22);
  for (int i = (n - 1) - (n - 1) % 10; i >= 0; i -= 10) write(w[i]); flush();
}