#include <stdio.h>
#include <queue>
using namespace std;
int k,n,a,b,c;
int m,j,i;
int v[10001*1001];
queue <int> sol[256];
int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    scanf("%d%d%d%d",&n,&a,&b,&c);
v[1]=b;
for(i=2;i<=n;i++)v[i]=(1LL*v[i-1]*a+b)%c;
for(i=0;i<=24;i+=8){

    for(j=1;j<=n;j++)
  sol[(v[j]>>i)&255].push(v[j]);
m=0;
    for(j=0;j<256&&m<n;j++)
    while(!sol[j].empty()){
        v[++m]=sol[j].front();
        sol[j].pop();




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


        return 0;
}