#include <bits/stdc++.h>

using namespace std;

const int N=10000005;
int v[N];
queue <int> q[256];

int main(){

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

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

    for(int i=0;i<32;i+=8){
        cnt=-1;
        for(j=0;j<n;j++) q[(v[j]>>i)&255].push(v[j]);
        for(k=0;k<256;k++)
            while(!q[k].empty())
                v[++cnt]=q[k].front(), q[k].pop();
    }

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



    return 0;
}