#include <bits/stdc++.h>

using namespace std;

const int N=10000005;
int v[N];

int main(){

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

    int n,a,b,c,i,j,cnt,k,it,l;
    scanf("%d%d%d%d",&n,&a,&b,&c);
    v[1]=b;
    for(i=2;i<=n;i++) v[i]=(1ll*a*v[i-1]+b)%c;

    for(i=0;i<32;i+=8){
        cnt=0;
        vector <int> G[256];
        for(j=1;j<=n;j++) G[(v[j]>>i)&255].push_back(v[j]);
        for(k=0;k<256;k++){
            l=G[k].size();
            for(it=0;it<l;it++) v[++cnt]=G[k][it];
        }
    }

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



    return 0;
}