#include<bits/stdc++.h>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int n,a,b,c,v[10000010],aux[10000010];
int i,t,f[256],ba;
int main()
{
    fin>>n>>a>>b>>c;v[1]=b;
    for(i=2;i<=n;i++) v[i]=(1ll*a*v[i-1]+b)%c;
    for(t=4;t--;)
    {
        for(i=1;i<=n;i++) f[((v[i]>>ba)&255)]++;
        for(i=1;i<=255;i++) f[i]+=f[i-1];
        for(i=n;i>=1;i--) aux[f[(v[i]>>ba)&255]]=v[i],f[(v[i]>>ba)&255]--;
        for(i=1;i<=n;i++) v[i]=aux[i];
        for(i=0;i<=255;i++) f[i]=0;
        ba+=8;
    }
    for(i=1;i<=n;i+=10) fout<<v[i]<<" ";
    return 0;
}