#include <bits/stdc++.h>

using namespace std;

const int N=10000005, Nr=(1<<30);
int v[N],aux[N];
vector <int> G[1024];

int main(){

    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);

    int n,a,b,c,i,j,cnt,k,it,op=0;
    scanf("%d%d%d%d",&n,&a,&b,&c);
    v[1]=b;
    for(i=1;i<=n;i++){
        v[i]=(1ll*a*v[i-1]+b)%c;
        if(v[i]>=Nr){
            aux[++op]=v[i];
            i--, n--;
        }
    }
    sort(aux+1, aux+op+1);

    for(i=0;i<30;i+=10){
        cnt=0;
        for(j=1;j<=n;j++) G[(v[j]>>i)&1023].push_back(v[j]);
        for(k=0;k<1024;k++){
            for(it=0;it<(int)G[k].size();it++) v[++cnt]=G[k][it];
            G[k].clear();
        }
    }
    for(i=1;i<=op;i++) v[++cnt]=aux[i];
    n+=op;

    for(i=1;i<=n;i+=10) printf("%d ",v[i]);
    printf("\n");



    return 0;
}