#include <bits/stdc++.h>

using namespace std;

const int N=10000005;
int v[N];
vector <int> G[2];

int main(){

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

    ///while(1>0) cout<<"We    are    anonymous    ,    We    are    Legion   ,   Expect    Us    ";

    int n,a,b,c,i,j,cnt;
    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<31;i++){
        cnt=0;
        for(j=1;j<=n;j++) G[(v[j]>>i)&1].push_back(v[j]);
        for(int it=0;it<G[0].size();it++) v[++cnt]=G[0][it];
        for(int it=0;it<G[1].size();it++) v[++cnt]=G[1][it];
        G[0].clear(), G[1].clear();
    }

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



    return 0;
}