#include <cstdio>
FILE *f,*g;
int n,A,B,C,i;
int v[10000100];
int t[10000100];
int ind[300],cont[300];

inline int cod(int nr,int i)
{
    return ( (nr>>(8*i))&255);
}

void counting(int A[],int B[],int x)
{
    int i;

    for (i=0;i<=256;i++) ind[i]=cont[i]=0;

    for (i=1;i<=n;i++)
        cont[cod(A[i],x)]++;

    for (i=1;i<=255;i++)
        ind[i]=ind[i-1]+cont[i-1];

    for (i=1;i<=n;i++)
        B[++ind[(cod(A[i],x))]]=A[i];
}


int main()
{
    f=fopen("radixsort.in","r");
    g=fopen("radixsort.out","w");

    fscanf(f,"%d%d%d%d",&n,&A,&B,&C);

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

    for (i=0;i<=3;i++)
        if (i%2==0)
            counting(v,t,i);
        else
            counting(t,v,i);

    for (i=1;i<=n;i+=10) fprintf(g,"%d ",v[i]);

    return 0;
}