#include <cstdio>
#include <queue>
#include <stdint.h>

uint32_t N, A, B, C, v[10000000], p;

void RadixSort(uint32_t v[], uint32_t begin, uint32_t end)
{
    std :: queue<uint32_t> bucket[256];

    for(int j = 0; j < 4; ++j)
    {
        for(int i = begin; i != end; ++i)
        {
            bucket[v[i] >> (j << 3) & 255].push(v[i]);
        }

        int index = begin;

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

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

char outBuffer[11000000];

void inline itoa(uint32_t x)
{
    uint32_t y, digits = 1 + (x > 9) + (x > 99) + (x > 999) + (x > 9999) + (x > 99999) + (x > 999999) + (x > 9999999) + (x > 99999999) + (x > 999999999);

    for(uint32_t i = digits - 1; ~i; --i)
    {
        y = x / 5 >> 1;

        outBuffer[p + i] = x - (y << 1) - (y << 3) + 48;

        x = y;
    }

    p += digits; outBuffer[p++] = 32;
}

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

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

    *v = B;

    for(uint32_t i = 1; i < N; ++i)
    {
        v[i] = (1ULL * v[~-i] * A + B) % C;
    }

    RadixSort(v, 0, N);

    for(uint32_t i = 0; i < N; i += 10)
    {
        itoa(v[i]);
    }

    puts(outBuffer);

    return 0;
}