#include <bits/stdc++.h>
#define NUM 10000005
#define BYTE 8
#define BUCK 256
using namespace std;
int v[NUM];
int temp[NUM];
int n, a, b, c;
FILE *f, *g;
void ByteSort(int * prim, int * sec, int byte)
{
    int counter[BUCK] = {0};
    int index[BUCK] = {0};

    for(int i = 0; i < n; ++i)
        ++counter[(prim[i] >> byte) & 255];

    for(int i = 1; i < BUCK; ++i)
        index[i] = index[i - 1] + counter[i - 1];

    for(int i = 0; i < n; ++i)
        sec[index[(prim[i] >> byte) & 255]++] = prim[i];
}
void radixSort()
{
    ByteSort(v, temp,        0);
    ByteSort(temp, v,     BYTE);
    ByteSort(v, temp, 2 * BYTE);
    ByteSort(temp, v, 3 * BYTE);
}
int main()
{
    f = fopen("radixsort.in", "r");
    g = fopen("radixsort.out", "w");

    fscanf(f, "%d%d%d%d", &n, &a, &b, &c);
    v[0] = b;
    for(int i = 1; i < n; ++i)
        v[i] = (1LL * a * v[i - 1] % c + b) % c;

    radixSort();

    for(int i = 0; i < n; i += 10)
        fprintf(g, "%d ", v[i]);
    fclose(f);
    fclose(g);
}