#include <cstdio>
#include <fstream>

using i32 = int;

using u32 = unsigned int;

using u64 = unsigned long long;

u32 N, A, B, C, v[10000000], w[10000000];

__attribute__((always_inline)) void CountingSort(u32 A[], u32 B[], u32 digit)
{
    u32 frequence[256]{}, index[256]; index[0] = ~0;

    for(u32 i = N; i; ++frequence[A[--i] >> digit & 255]);

    for(u32 i = 0; i != 256; index[++i] = index[~-i] + frequence[~-i]);

    for(u32 i = 0; i != N; ++i) B[++index[A[i] >> digit & 255]] = A[i];
}

char outBuffer[11000000]; i32 p = 11000000;

__attribute__((always_inline)) void write(u32 x)
{
    outBuffer[--p] = 32;

    do
    {
        outBuffer[--p] = x % 10 + 48;

        x /= 10;
    }
    while(x);
}

i32 main()
{
    freopen("radixsort.in", "r", stdin);

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

    v[~-N] = B;

    if(C == 914107849)
    {
        for(u32 i = ~-N; i; )
        {
            v[--i] = (u64(v[-~i]) * A + B) % 914107849;
        }
    }
    else if(C == 2095480566)
    {
        for(u32 i = ~-N; i;)
        {
            v[--i] = (u64(v[-~i]) * A + B) % 2095480566;
        }
    }
    else if(C == 1869500027)
    {
        for(u32 i = ~-N; i;)
        {
            v[--i] = (u64(v[-~i]) * A + B) % 1869500027;
        }
    }
    else
    {
        for(u32 i = ~-N; i;)
        {
            u64 j = u64(v[-~--i]) * A + B;

            v[i] = C > j ? j : j - j / C * C;
        }
    }

    CountingSort(v, w,  0); CountingSort(w, v,  8);

    CountingSort(v, w, 16); CountingSort(w, v, 24);

    for(u32 i = N - 1 - (N - 1) % 10 + 10; i; i = i - 10, write(v[i]));

    fwrite(outBuffer + p, 1, 10999999 - p, stdout);

    std :: ofstream("radixsort.out").write(outBuffer + p, 10999999 - p);

    return 0;
}