#include <bits/stdc++.h>
using namespace std;

const int nmax=10000005;

const int mod=1e9+7;

int n,x,y,z,a[nmax],tz[nmax],counter[258];

int main(){
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    cin >> n >> x >> y >> z;
    a[1]=y;
    for(int i=2;i<=n;i++) a[i]=((1LL*a[i-1]*x)%z+y)%z;
    int cnt=0;
    int byte=4;
    while(byte--){
        for(int i=1;i<=256;i++) counter[i]=0;
        for(int i=1;i<=n;i++){
            counter[(a[i]>>cnt)&255]++;
        }
        for(int i=1;i<=255;i++) counter[i]+=counter[i-1];
        for(int i=n;i>=1;i--){
            tz[counter[(a[i]>>cnt)&255]]=a[i];
            counter[(a[i]>>cnt)&255]--;
        }
        for(int i=1;i<=n;i++) a[i]=tz[i];
        cnt+=8;
    }
    for(int i=1;i<=n;i+=10) cout << a[i] << ' ';
}