#include<fstream>
using namespace std;

ifstream  fin("radixsort.in");
ofstream fout("radixsort.out");

unsigned int aa, bb, cc, a[2][10000009], pr[10000], ul[10000], n, i, nr[10000], cif, k, x, baza;
long long p, p1;

int main()
{
    baza=10000;
    fin>>n>>aa>>bb>>cc;
    p=1;
    a[0][1]=bb;
    nr[a[0][1]/p%baza]++;
    for(i=2;i<=n;i++)
    {
        a[0][i]=(aa*a[0][i-1]+bb)%cc;
        nr[a[0][i]/p%baza]++;
    }

    for(k=1;k<=3;k++)
    {
        pr[0]=1;
        ul[0]=0;
        for(i=1;i<=baza-1;i++)
        {
            pr[i]=pr[i-1]+nr[i-1];
            ul[i]=pr[i]-1;
            nr[i-1]=0;
        }
        nr[baza-1]=0;

        p1=p*baza;
        for(i=1;i<=n;i++)
        {
            x=a[1-k%2][i];
            cif=x/p%baza;
            ul[cif]++;
            a[k%2][ul[cif]]=x;
            nr[x/p1%baza]++;
        }
        p=p1;
    }

    for(i=1;i<=n;i=i+10)
    {
        fout<<a[0][i]<<" ";
    }
    fout<<"\n";
    fout.close();
    fin.close();
    return 0;
}