#include <cstdio>

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

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

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

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

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

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 * A * v[i - 1] + B) % C;
    }

    CountingSort(v, w, 0);
    CountingSort(w, v, 8);
    CountingSort(v, w, 16);
    CountingSort(w, v, 24);

    for(int i = 0; i != N; i += 10)

        printf("%d ", v[i]);

    return 0;
}