#include <cstdio>
#include <algorithm>
using namespace std;
FILE *f=fopen("radixsort.in","r");
FILE *g=fopen("radixsort.out","w");
int n,a,b,c,v[10000001],put=1,maxim,nr;
bool ok;
struct nod{int val;
           nod *adr;
           nod() {val=0;
                  adr=NULL;}
           };
nod *p[10],*u[10];


int main()
{int i,j;
fscanf(f,"%d %d %d %d",&n,&a,&b,&c);
v[1]=b;
for (i=2;i<=n;i++) {v[i]=(a*(v[i-1])+b)%c;
                    maxim=max(maxim,v[i]);}
while (1LL*put<=maxim)
{

for (i=1;i<=n;i++) {j=(v[i]/put)%10;

                    if (p[j]==NULL) {p[j]=new nod;
                                     p[j]->val=v[i];
                                     p[j]->adr=NULL;

                                     u[j]=p[j];
                                     }
                               else {nod *t=new nod;
                                     t->val=v[i];
                                     t->adr=NULL;

                                     u[j]->adr=t;
                                     u[j]=t;
                                     }
                    }
nr=0;
for (i=0;i<=9;i++) {nod *t=p[i];
                    while (t!=NULL) {v[++nr]=t->val;
                                     t=t->adr;}
                    }
for (i=0;i<=9;i++) {delete(p[i]);p[i]=NULL;
                    delete(u[i]);u[i]=NULL;
                    }
put=put*10;}
for (i=1;i<=n;i+=10) fprintf(g,"%d ",v[i]);
return 0;
}