#include <fstream>
#include <stack>
#define B 2
#define biti 16
#define DIM 10000010

using namespace std;

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

//2 16
//4 8


int v[DIM], w[DIM];
int f[1<<biti];
int n, a, b, c, i, p, k;

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


    for (p = 0; p<B; p++) {
        for (i=0;i<(1<<biti);i++)
            f[i] = 0;

        for (i=1;i<=n;i++)
            f[  (v[i]>>(p*biti)) & ((1<<biti)-1) ]++;

        for (i=1;i<=(1<<biti)-1;i++)
            f[i] += f[i-1];


        for (i=n;i>=1;i--) {
            w[ f[  (v[i]>>(p*biti)) & ((1<<biti)-1) ] ] = v[i];
            f[  (v[i]>>(p*biti)) & ((1<<biti)-1) ] --;
        }




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

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

    int mask = 0xffff;   // mask = 255;

    int a[] = {0, 16};


    for (p = 0; p<=1; p++) {
        // sortam dupa al p-lea grup de 8 biti numarat de la dreapta
        for (i=0;i<=65535;i++)
            f[i] = 0;


    }
*/

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

    return 0;
}