#include <cstdio>
#include <algorithm>
#include <deque>
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;

deque <int> q[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;
                    q[j].push_back(v[i]);
                    }
nr=0;
for (i=0;i<=9;i++) {while (!q[i].empty()) {v[++nr]=q[i].front();
                                           q[i].pop_front();}
                    }
put=put*10;}
for (i=1;i<=n;i+=10) fprintf(g,"%d ",v[i]);
return 0;
}