#include <bits/stdc++.h>

using namespace std;

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

int main(){

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

    int n,a,b,c,i,j,cnt,k,it;
    bool sem=1;
    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;

    for(i=0;i<32;i+=16){
        cnt=0;
        for(j=1;j<=n;j++) G[(v[j]>>i)&(Nr-1)].push_back(v[j]);
        for(k=0;k<Nr;k++){
            for(it=0;it<(int)G[k].size();it++) v[++cnt]=G[k][it];
            G[k].clear();
        }
    }

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



    return 0;
}