#include <iostream>
#include <fstream>
using namespace std;

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

const int N=10000000;
const int baza = 10;
const int B = (1 << baza);

int poz[B], f[B], v[2][N];
int n,a,b,c,i,nc,maxim,p,k,j,cif;

void clr(){
    for(j=0; j<B; j++)
        f[j] = 0;
}
int main()
{
    in>>n>>a>>b>>c;
    v[0][0]=b;
    maxim=b;
    for(i=1;i<n;i++)
        {v[0][i]=(a*(long long)v[0][i-1]+b)%c;
        maxim = max(maxim, v[0][i]);
        }
    while(maxim){
        nc++;
        maxim /= B;
    }

    for(k=0; k<nc; k++)
    {
        clr();
        for(i=0; i<n; i++)
        {
            cif = (v[k % 2][i] >> p) & (B - 1);
            f[cif]++;
        }
        poz[0] = 0;
        for(j=1; j<B; j++)
            poz[j] = poz[j-1] + f[j-1];
        for(i=0; i<n; i++){
            cif = (v[k % 2][i] >> p) & (B - 1);
            v[1 - k%2][poz[cif]++] = v[k % 2][i];
        }
        p += baza;
    }
    for(i=0; i<n; i+=10)
        out << v[nc%2][i] << " ";

    return 0;

}