#include <cstdio>
#include <fstream>

using i32 = int;

using u32 = unsigned int;

using u64 = unsigned long long;

u32 N, A, B, C, v[0x989680], w[0x989680];

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

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

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

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

char outBuffer[0xA7D8C0]; i32 p = 0xA7D8C0;

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

    do
    {
        outBuffer[--p] = x % 0xA + 0x30;

        x /= 0xA;
    }
    while(x);
}

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

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

    v[0x0] = B;

    if(C == 0x367C2DC9)
    {
        for(u32 i = 0x1; i != N; ++i)
        {
            v[i] = (u64(v[~-i]) * A + B) % 0x367C2DC9;
        }
    }
    else if(C == 0x7CE67EF6)
    {
        for(u32 i = 0x1; i != N; ++i)
        {
            v[i] = (u64(v[~-i]) * A + B) % 0x7CE67EF6;
        }
    }
    else if(C == 0x6F6E4E7B)
    {
        for(u32 i = 0x1; i != N; ++i)
        {
            v[i] = (u64(v[~-i]) * A + B) % 0x6F6E4E7B;
        }
    }
    else
    {
        for(u32 i = 0x1; i != N; ++i)
        {
            u64 j = u64(v[~-i]) * A + B;

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

    CountingSort(v, w, 0x0);
    CountingSort(w, v, 0x8);
    CountingSort(v, w, 0x10);
    CountingSort(w, v, 0x18);

    for(u32 i = N - 0x1 - (N - 0x1) % 0xA + 0XA; i;)

        i = i - 0xA, write(v[i]);

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

    return 0x0;
}