#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
//#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int nmax=10000005;
const int bucket=(1<<8)-1;

const int mod=1e9+7;

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

int getbyte(int x,int byte){
    return ((x>>(8*byte))&bucket);
}

void byteSort(int byte){
    vector<int>counter(bucket+5);
    for(int i=1;i<=n;i++){
        counter[getbyte(a[i],byte)]++;
    }
    for(int i=1;i<=bucket;i++) counter[i]+=counter[i-1];
    for(int i=n;i>=1;i--){
        tz[counter[getbyte(a[i],byte)]]=a[i];
        counter[getbyte(a[i],byte)]--;
    }
    for(int i=1;i<=n;i++) a[i]=tz[i];
}

void radixsort(){
    for(int byte=0;byte<4;byte++){
        byteSort(byte);
    }
}

int32_t 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;
    radixsort();
    for(int i=1;i<=n;i+=10) cout << a[i] << ' ';
}