#include <cstdio>
#include <queue>
#include <fstream>

using i32 = int;

using u32 = unsigned int;

using u64 = unsigned long long;

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

void RadixSort(u32 v[], u32 left, u32 right)
{
    std :: queue<u32> bucket[256];

    for(u32 j = 0; j < 32; j += 8)
    {
        for(u32 i = left; i <= right; i++)
        {
            bucket[(v[i] >> j) & 255].push(v[i]);
        }

        u32 index = ~0;

        for(u32 i = 0; i < 256; i++)
        {
            while(!bucket[i].empty())
            {
                v[++index] = bucket[i].front();

                bucket[i].pop();
            }
        }
    }
}

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[~-N] = B;

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

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

    RadixSort(v, 0, ~-N);

    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;
}