#include <bits/stdc++.h>

int N, A, B, C, i = 1, v['ॆ'];

main()
{
    std :: ifstream("radixsort.in") >> N >> A >> B >> C;

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

    std :: queue<int> b[C=256];

    for(A = 0; A < 4; ++A)
    {
        for(i = B = 0; i - N; b[v[i++] >> A * 8 % C].push(v[i]));

        for(i = 0; i < C; ++i)

            for(; b[i].size(); v[B++] = b[i].front(), b[i].pop());
    }

    std :: ofstream o("radixsort.out");

    for(i = 0; i < N; i += 10) o << v[i] << ' ';
}