#include <fstream>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
long long n,A,B,C,t,p;
int v[10000010],f[256],i,w[10000010];
int main(){
    fin>>n>>A>>B>>C;
    v[1]=B;
    for(i=2;i<=n;i++)
        v[i]=(A*1LL*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++)
            f[((v[i]>>p)&255)]++;
        for(i=1;i<=255;i++)
            f[i]+=f[i-1];
        for(i=n;i>=1;i--){
            w[f[((v[i]>>p)&255)]]=v[i];
            f[((v[i]>>p)&255)]--;
        }
        p+=8;
        for(i=1;i<=n;i++)
            v[i]=w[i];
    }
    for(i=1;i<=n;i+=10)
        fout<<v[i]<<" ";
    return 0;
}