#include<cstdio>
#include<vector>
#define K 255
using namespace std;
int A, B, C, N;
int v[10000005];

void Solve( int Shift )
{
    vector <int> X[257];

    for ( int i = 1; i <= N; i++)
        X[(v[i] >> Shift) & K].push_back(v[i]);

    int poz=0;
    for(int i=0; i<= K; i++)
        for(int j = 0; j < X[i].size(); j++)
            v[++poz] = X[i][j];
}
int main()
    {
        int i;
        freopen("radixsort.in","r",stdin);
        freopen("radixsort.out","w",stdout);
        scanf("%d%d%d%d", &N, &A, &B, &C);
        v[1] = B;
        for (i = 2; i <= N; i++)
            v[i] = 1LL * (A * v[i-1] + B) % C;

        for (i = 0; i <= 3; i++)
            Solve(i * 8);

        for (i = 1; i <= N; i += 10)
            printf("%d ", v[i]);

    }