#include <fstream>
#include <bitset>
#include <cstring>

using namespace std;

ifstream fin("radixsort.in");

int n, i, j, sol[10000001], v[10000001], nrcifre, maxim, x, nr, cif, b, c, divi;
long long a;

int main(){
    freopen("radixsort.out", "w", stdout);
    fin>>n>>a>>b>>c;
    v[1] = maxim = b;
    int f[257];
    for(i=2;i<=n;++i){
        v[i] = (a*v[i-1] + b)%c;
    }
    for(j=1, divi = 0;j<=2;++j, divi += 4){
        memset(f, 0, sizeof f);
        for(i=1;i<=n;++i){
            ++f[((v[i]>>divi)&255)];
        }
        for(i=1;i<256;++i)
            f[i] += f[i-1];
        for(i=n;i>0;i--){
            sol[f[((v[i]>>divi)&255)]--] = v[i];
        }
        if(j==2){
            for(i=1;i<=n;i+=10)
                printf("%d ", sol[i]);
            return 0;
        }
        memcpy(v, sol, (n+1) << 2);
    }

    return 0;
}