#include <cstdio>
#include <queue>

int N, A, B, C, v[10000000];

void RadixSort(int v[], int begin, int end)
{
    std :: queue<int> 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();
            }
        }
    }
}

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

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

    v[0] = B;

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

    RadixSort(v, 0, N);

    for(int i = 0; i < N; i += 10)
    {
        printf("%d ", v[i]);
    }

    return 0;
}