#include <bits/stdc++.h>

using namespace std;
const int N = 10000001;
int n,X[N],Y[N],p[256],*x,*y,buket;
int A,B,C;
int main()
{
    freopen("radixsort.out","w",stdout);
    freopen("radixsort.in","r",stdin);
    scanf("%d%d%d%d",&n,&A,&B,&C);
    x=X;y=Y;
    x[1]=B;
    for(int i=2;i<=n;i++)
        x[i]=(1LL*A*x[i-1]%C+B)%C;
    for(int step = 0;step<4;step++)
    {
        int shift=8*step;
        for(int i=0;i<256;i++)
            p[i]=0;
        for(int i=1;i<=n;i++)
        {
            buket = (x[i]>>shift)&255;
            p[buket]++;
        }
        for(int i=1;i<256;i++)
            p[i]+=p[i-1];
        for(int i=n;i>=1;i--)
        {
            buket=(x[i]>>shift)&255;
            y[p[buket]]=x[i];
            p[buket]--;
        }
        int *aux=x;x=y;y=aux;
    }
    for(int i=1;i<=n;i+=10)
        printf("%d ",x[i]);
    return 0;
}