#include<cstdio>
using namespace std;
const int NMAX = 10000005;
const int MASK = (1<<8)-1;
int N,A,B,C,V[2][NMAX],i,j,k,c,n,shift,Buckets[MASK+5];
int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    scanf("%d%d%d%d",&N,&A,&B,&C);
    for(V[0][1]=B,i=2;i<=N;i++) V[0][i]=(1LL*A*V[0][i-1]+B)%C;
    for(n=1,i=0,shift=0;i<4;i++,shift+=8)
    {
        for(j=1;j<=N;j++)
        {
            k=(V[c][j]>>shift)&MASK;
            Buckets[k]++;
        }
        for(j=1;j<=MASK;j++)
            Buckets[j]+=Buckets[j-1];
        for(j=N;j;j--)
        {
            k=(V[c][j]>>shift)&MASK;
            V[n][Buckets[k]]=V[c][j];
            Buckets[k]--;
        }
        c=1-c;n=1-n;
        for(j=0;j<=MASK;j++) Buckets[j]=0;
    }
    for(i=1;i<=N;i+=10) printf("%d ",V[c][i]);
    return 0;
}