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

ifstream f("radixsort.in");
ofstream g("radixsort.out");
#define cin f
#define cout g
typedef long long ll;

void counting_sort(ll v[], ll n, ll p) {
    ll frecv[256];
    for(ll i = 0; i < 256; i++) 
        frecv[i] = 0;
    ll aux[n + 1];
    for(ll i = 1; i <= n; i++) 
        frecv[(v[i] >> p) & 255]++;
    
    for(ll i = 1; i < 256; i++) 
        frecv[i] += frecv[i - 1];
    
    for(ll i = n; i >= 1; i--) {
        aux[frecv[(v[i] >> p) & 255]] = v[i];
        frecv[(v[i] >> p) & 255]--;
    }

    for(ll i = 1; i <= n; i++) 
        v[i] = aux[i];
}
        

void radixsort(ll v[], ll n) {
    ll mx = 0;
    for(ll i = 1; i <= n; i++) 
        mx = max(mx, v[i]);
    ll p = 0;
    while(mx > 0) {
        counting_sort(v, n, p);
        p+=8;
        mx>>=8;
    }
}

int main() {
    ll n, a, b, c;
    cin >> n >> a >> b >> c;
    ll v[n + 1];
    v[1] = b;
    for(ll i = 2; i <= n; i++) {
        v[i] = (a  * v[i - 1] + b) % c;
    }

    radixsort(v, n);
    for(ll i = 1; i <= n; i += 10) {
        cout << v[i] << " ";
    }
    return 0;
}