#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>
 
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
 
using namespace std;
 
const int nmax = 10000005;
const int mask = (1 << 8) - 1;
 
int n, a, b, c, i, k, shift, bucket[mask + 5], v[nmax], w[nmax];
 
int main()
{
    freopen("radixsort.in", "r", stdin);
    freopen("radixsort.out", "w", stdout);
 
    scanf("%d%d%d%d", &n, &a, &b, &c);
 
    v[1] = b;
    for(i = 2; i <= n; i++)
        v[i] = (1LL * a * v[i - 1] + b) % c;
 
    for(shift = 0; shift < 32; shift += 8)
    {
        for(i = 1; i <= n; i++)
        {
            k = (v[i] >> shift) & mask;
            bucket[k]++;
        }
 
        for(i = 1; i <= mask; i++)
            bucket[i] += bucket[i - 1];
 
        for(i = n; i; i--)
        {
            k = (v[i] >> shift) & mask;
            w[bucket[k]--] = v[i];
        }
 
        for(i = 1; i <= n; i++)
            v[i] = w[i];
 
        for(i = 0; i <= mask; i++)
            bucket[i] = 0;
    }
 
    for(i = 1; i <= n; i += 10)
        printf("%d ", v[i]);
 
    return 0;
}