#include <fstream>

using namespace std;

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

int v[10000010],w[10000010],f[256],n,a,b,i,j,maxim,nr,c,mask;
long long x,y;
int p[]={0,8,16,24};

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];

    mask=0xff;

    for (i=0;i<=3;i++) {

        for (j=n;j>=1;j--)
            f[ (v[j]>>p[i]) & mask ]++;

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

        for (j=n;j>=1;j--) {
            w[f[ (v[j]>>p[i]) & mask ]]=v[j];
            f[ (v[j]>>p[i]) & mask ]--;
        }

        for (j=0;j<=255;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;
}