#include <bits/stdc++.h>

using namespace std;

const int N=10000005, Val=(1<<30);
int v[N];
vector <int> aux;

int main(){

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

    int n,a,b,c,cnt;
    bool sem=0;
    scanf("%d%d%d%d",&n,&a,&b,&c);
    v[1]=b;
    for(int i=2;i<=n;i++){
        if(sem) v[i]=(1ll*a*v[i]+b)%c;
        else v[i]=(1ll*a*v[i-1]+b)%c;
        sem=0;
        if(v[i]>=Val){
            aux.push_back(v[i]);
            i--,n--;
            sem=1;
        }
    }
    sort(aux.begin(),aux.end());

    for(int i=0;i<30;i+=10){
        cnt=0;
        vector <int> G[1024];
        for(int j=1;j<=n;j++) G[(v[j]>>i)&1023].push_back(v[j]);
        for(int k=0;k<1024;k++)
            for(int it=0;it<G[k].size();it++) v[++cnt]=G[k][it];
    }

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



    return 0;
}