#include <bits/stdc++.h>

#define MaxN 10000005

std::ifstream InFile("radixsort.in");
std::ofstream OutFile("radixsort.out");

int N, A, B, C;
int V[MaxN];

int Aux[MaxN];
int DigitCount[256];

void CountSort(int nbytes) {
    for (int i=1; i<=255; ++i)
        DigitCount[i] = 0;

    for (int i=1; i<=N; ++i)
        DigitCount[(V[i] >> (8*nbytes)) & 255] ++;

    for (int i=1; i<=255; ++i)
        DigitCount[i] += DigitCount[i-1];

    for (int i=N, Digit; i>0; --i) {
        Digit = (V[i] >> (8*nbytes)) & 255;
        Aux[DigitCount[Digit]] = V[i];
        --DigitCount[Digit];
    }

    for (int i=1; i<=N; ++i)
        V[i] = Aux[i];
}

void Radix() {
    for (int byte=0; byte<4; ++byte)
        CountSort(byte);
}

void Citire() {
    InFile >> N >> A >> B >> C;

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

void Rezolvare() {
    Radix();

    for (int i=1; i<=N; i+=10)
        OutFile << V[i] << ' ' ;
}

int main()
{
    Citire();
    Rezolvare();

    return 0;
}