#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#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 mod=1e9+7;
const int modp=1999999973;
const int modulo=998244353;

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

void radix(int sz){
    vector<int>tz(n+5);
    for(int i=1;i<=n;i++) tz[i]=a[i];
    for(int i=1;i<=n;i++) sorted[i]=i;
    for(int i=1;i<=sz;i++){
        vector<int>countsort[10];
        for(int j=1;j<=n;j++){
            countsort[a[sorted[j]]%10].push_back(sorted[j]);
            a[sorted[j]]/=10;
        }
        int cnt=0;
        for(int j=0;j<=9;j++){
            for(auto it:countsort[j]){
                cnt++;
                sorted[cnt]=it;
            }
        }
    }
    for(int i=1;i<=n;i++) a[i]=tz[i];
}

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]=(x*(a[i-1])+y)%z;
    }
    int maxi=*max_element(a+1,a+n+1);
    radix(sizeof(maxi));
    for(int i=1;i<=n;i+=10){
        cout << a[sorted[i]] << ' ';
    }
}