#include <bits/stdc++.h>

using namespace std;

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

int n, a, b, c, i, x, t, p;
int v[10000005], f[270], aux[10000005];

int cifra (int a, int b){
    return ((a>>b)&255);
}

int main(){
    fin >> n >> a >> b >> c;
    v[1] = b;
    for (i=2; i<=n; i++){
        v[i] = (a*v[i-1] + b)%c;
    }
    for (t=1; t<=4; t++){
        for (i=0; i<=255; i++){
            f[i] = 0;
        }
        for (i=1; i<=n; i++){
            x = cifra (v[i], p);
            f[x]++;
        }
        for (i=1; i<=256; i++){
            f[i] += f[i-1];
        }
        for (i=n; i>=1; i--){
            x = cifra (v[i], p);
            aux[f[x]] = v[i];
            f[x]--;
        }
        for (i=1; i<=n; i++){
            v[i] = aux[i];
        }
        p += 8;
    }
    for (i=1; i<=n; i+=10){
        fout << v[i] << " ";
    }
    return 0;
}