#include <cstdio>
#include <queue>

unsigned int N, A, B, C, v[0x989680], p;

void RadixSort(unsigned int v[], unsigned int begin, unsigned int end)
{
    std :: queue<unsigned int> bucket[0x100];

    for(int j = 0x0; j < 0x4; ++j)
    {
        for(int i = begin; i != end; ++i)
        {
            bucket[v[i] >> (j << 0x3) & 0xFF].push(v[i]);
        }

        int index = begin;

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

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

char outBuffer[0xA7D8C0];

void inline itoa(unsigned int x)
{
    unsigned int y, digits = x > 0x3B9AC9FF ? 0xA : x > 0x5F5E0FF ? 0x9 : x > 0x98967F ? 0x8 : x > 0xF423F ? 0x7 : x > 0x1869F ? 0x6 : x > 0x270F ? 0x5 : x > 0x3E7 ? 0x4 : x > 0x63 ? 0x3 : x > 0x9 ? 0x2 : 0x1;

    for(unsigned int i = digits - 0x1; ~i; --i)
    {
        y = x / 0xA;

        outBuffer[p + i] = x - (y << 0x1) - (y << 0x3) + 0x30;

        x = y;
    }

    p += digits; outBuffer[p++] = 0x20;
}

int main()
{
    freopen("radixsort.in", "r", stdin);
    freopen("radixsort.out", "w", stdout);

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

    *v = B;

    for(unsigned int i = 0x1; i < N; ++i)
    {
        unsigned long long j = 0x1ULL * v[~-i] * A + B;

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

    RadixSort(v, 0x0, N);

    for(unsigned int i = 0x0; i < N; i += 0xA)
    {
        itoa(v[i]);
    }

    puts(outBuffer);
}