#include <fstream>
#include <bitset>

using namespace std;

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

int n, i, j, sol[10000001], v[10000001], nrcifre, maxim, x, nr, cif, a, b, c;
int f[300], last[300];

int main(){
    fin>>n>>a>>b>>c;
    v[1] = maxim = b;
    for(i=2;i<=n;i++){
        v[i] = (a*1LL*v[i-1] + b)%c;
        if(v[i] > maxim)
            maxim = v[i];
    }
    while(maxim){
        nrcifre++;
        maxim /= 256;
    }
    for(j=1;j<=nrcifre;j++){
        for(i=0;i<256;i++)
            f[i] = 0;
        for(i=1;i<=n;i++){
            x = v[i];
            nr = 0;
            cif = 0;
            while(x && nr <= j){
                nr++;
                if(nr == j)
                    cif = x%256;
                x /= 256;
            }
            f[cif]++;
        }
        for(i=1;i<256;i++)
            f[i] += f[i-1], last[i] = f[i-1]+1;
        last[0] = 1;
        for(i=1;i<=n;i++){
            x = v[i];
            nr = 0;
            cif = 0;
            while(x && nr <= j){
                nr++;
                if(nr == j)
                    cif = x%256;
                x /= 256;
            }
            sol[last[cif]] = v[i];
            last[cif]++;
        }
        for(i=1;i<=n;i++)
            v[i] = sol[i];
    }
    for(i=1;i<=n;i+=10)
        fout<<v[i]<<" ";
    return 0;
}