#include <fstream>

using namespace std;

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

int v[10000010],w[10000010],f[15],n,a,b,x,y,i,j,maxim,nr,c;

int main () {

    fin>>n>>a>>b>>c;
    v[1]=b;
    for (i=2;i<=n;i++){
        v[i]=(1LL*a*v[i-1]+1LL*b)%c;
        //fin>>v[i];
        if (v[i]>maxim)
            maxim=v[i];

    }

    while (maxim!=0) {
        nr++;
        maxim/=10;
    }


    for (i=1,x=10,y=1;i<=nr;i++,x*=10,y*=10) {

        for (j=n;j>=1;j--)
            f[v[j]%x/y]++;

        for (j=1;j<=9;j++)
            f[j]+=f[j-1];

        for (j=n;j>=1;j--) {
            w[f[v[j]%x/y]]=v[j];
            f[v[j]%x/y]--;
        }

        for (j=0;j<=9;j++)
            f[j]=0;

        for (j=1;j<=n;j++)
            v[j]=w[j];


    }

    for (i=1;i<=n;i+=10)
        fout<<v[i]<<" ";
    return 0;
}