#include <cstdio>
#define N 10000010
using namespace std;
int n,a,b,c,x[2][N],B[256],i,mask=255,shift;
int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    scanf("%d%d%d%d",&n,&a,&b,&c);
    x[0][1]=b;
    for(i=2;i<=n;i++)x[0][i]=(1LL*a*x[0][i-1]%c+b)%c;
    a=0;c=1;b=0;
    for(;shift<=24;shift+=8)
    {
        for(i=1;i<=n;i++){b=(x[a][i]>>shift)&mask;B[b]++;}
        for(i=1;i<=mask;i++)B[i]+=B[i-1];
        for(i=n;i;i--)
        {
            b=(x[a][i]>>shift)&mask;
            x[c][B[b]]=x[a][i];
            B[b]--;
        }
        a=1-a;c=1-c;
    }
    for(i=1;i<=n;i+=10)
        printf("%d ",x[a][i]);
    return 0;
}