#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,cnt;
    scanf("%d%d%d%d",&n,&a,&b,&c);
    v[0]=b;
    for(int i=1;i<n;i++) v[i]=(1ll*a*v[i-1]+b)%c;

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

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



    return 0;
}