#include<cstdio>
#include<queue>
#include<algorithm>
#include<cstring>
using namespace std;
FILE*in=fopen("radixsort.in","r");
FILE*out=fopen("radixsort.out","w");
int f[256];
long long n,a,b,c,i,po=0,ct,j;
long long v[20000009];
int val;
int main()
{
    fscanf(in,"%d%d%d%d",&n,&a,&b,&c);
    val=n;
    v[0]=b;
    for(i=1;i<n;i++)
    {
        v[i]=(long long)(a*v[i-1]+b)%c;
    }
    for(po=0;po<32;po+=8)
    {
        memset(f,0,sizeof(f));
        for(i=n-val;i<2*n-val;i++)
        {
            f[(v[i]>>po)&255]++;
        }
        f[0]=val;
        for(i=1;i<=255;i++)
        {
            f[i]=f[i-1]+f[i];
        }
        for(i=255;i>=1;i--)
        {
            f[i]=f[i-1];
        }
        f[0]=val;
        for(i=n-val;i<2*n-val;i++)
        {
            v[f[(v[i]>>po)&255]]=v[i];
            f[(v[i]>>po)&255]++;
        }
        val=n-val;
    }
    for(i=n-val;i<2*n-val;i+=10)
    {
        fprintf(out,"%d ",v[i]);
    }
}