#include <fstream>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int fr[10000005],n,a,b,c,v[10000005],i,j,maxim,copie[10000005]; long long base,basesp;
int main()
{
    f>>n>>a>>b>>c;
    v[1]=b;
    base=1000;
    basesp=1;
    for (i=2;i<=n;i++)
    {
        v[i]=(a*v[i-1]+b)%c;
    }
    for (i=1;i<=3;i++)
    {
        for (j=1;j<=n;j++)
        {
            fr[v[j]%base/basesp]++;
            if (v[j]%base/basesp>maxim)
            {
                maxim=v[j]%base/basesp;
            }
        }
        for (j=1;j<=maxim;j++)
            {
                fr[j]=fr[j-1]+fr[j];
            }
            for (j=1;j<=n;j++)
            {
                copie[fr[v[j]%base/basesp]]=v[j];
                fr[v[j]%base/basesp]--;
            }
            for (j=1;j<=n;j++)
            {
                v[j]=copie[j];
            }
            for (j=1;j<=maxim;j++)
            {
                fr[j]=0;
            }
            base=base*1000;
            basesp=basesp*1000;
    }
    for (j=1;j<=n;j+=10)
    {
        g<<v[j]<<" ";
    }
    return 0;
}