#include <fstream>
#include <string.h>

const int MAX_N = 1e7;
const int MOD = (1 << 11);
int v[2][MAX_N], cnt[MOD];
int n;

void reorder(int bucket, int aux) {
  memset(cnt, 0, sizeof(cnt));
  for (int i = 0; i < n; i++) {
    cnt[(v[1 - aux][i] >> bucket) % MOD]++;
  }
  for (int i = 1; i < MOD; i++) {
    cnt[i] += cnt[i - 1];
  }
  for (int i = n - 1; i >= 0; i--) {
    v[aux][--cnt[(v[1 - aux][i] >> bucket) % MOD]] = v[1 - aux][i];
  }
}

void radix() {
  for (int bucket = 0; bucket < 3; bucket++) {
    reorder(11 * bucket, 1 - bucket % 2);
  }
}

int main() {
  std::ifstream fin("radixsort.in");
  std::ofstream fout("radixsort.out");
  int a, b, c;
  fin >> n >> a >> b >> c;
  v[0][0] = b;
  for (int i = 1; i < n; i++) {
    v[0][i] = (v[0][i - 1] * a + b) % c;
  }
  radix();
  for (int i = 0; i < n; i += 10) {
    fout << v[1][i] << " ";
  }
  return 0;
}