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

const int nmax=10000005;
const int bucket=255;

const int mod=1e9+7;

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

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream cin("radixsort.in");
    ofstream cout("radixsort.out");
    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;
    vector<int>counter(300);
    int cnt=0;
    for(int byte=0;byte<4;byte++){
        for(int i=1;i<=256;i++) counter[i]=0;
        for(int i=1;i<=n;i++){
            counter[(a[i]>>8*cnt)&bucket]++;
        }
        for(int i=1;i<=bucket;i++) counter[i]+=counter[i-1];
        for(int i=n;i>=1;i--){
            tz[counter[(a[i]>>8*cnt)&bucket]]=a[i];
            counter[(a[i]>>8*cnt)&bucket]--;
        }
        for(int i=1;i<=n;i++) a[i]=tz[i];
        cnt+=8;
    }
    for(int i=1;i<=n;i+=10) cout << a[i] << ' ';
}