#include<cstdio>
#include<string>
#include<cstring>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "radixsort";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 10000000 + 5;

int V[NMAX];
int aux[NMAX];
int N, A, B, C;

void radixsort(int V[], int lo, int hi) {
    int MASK = (1LL << 8) - 1;
    int bits, i;
    int bucket[1LL << 8];
    int *A = V, *B = aux;

    for(bits = 0; bits < 32; bits += 8) {
        memset(bucket, 0, sizeof(bucket));

        for(i = lo; i <= hi; i++)
            bucket[(A[i] >> bits)&MASK]++;

        for(i = 1; i <= MASK; i++)
            bucket[i] += bucket[i - 1];

        for(i = hi; i >= lo; i--)
            B[bucket[(A[i] >> bits)&MASK]--] = A[i];

        swap(A, B);
    }
}

int main() {
    int i;

    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);

    scanf("%d%d%d%d", &N, &A, &B, &C);

    V[1] = B;

    for(i = 2; i <= N; i++)
        V[i] = (A * 1LL * V[i - 1] + B) % C;

    radixsort(V, 1, N);

    for(i = 1; i <= N; i += 10)
        printf("%d ", V[i]);

    return 0;
}