#include <stdio.h>
#include <algorithm>
using namespace std;

#define MAX_N 10000000

int v1[MAX_N];

int main() {
  FILE* fin = fopen("radixsort.in", "r");
  int n, a, b, c, i;
  fscanf(fin, "%d%d%d%d", &n, &a, &b, &c);
  v1[0] = b;
  for (i = 1; i < n; ++i)
    v1[i] = ((long long)a * v1[i - 1] + b) % c;
  fclose(fin);

  sort(v1, v1 + n);

  FILE* fout = fopen("radixsort.out", "w");
  for (i = 0; i < n; i += 10)
    fprintf(fout, "%d ", v1[i]);
  fclose(fout);
  return 0;
}