#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define modul 998244353
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int n,a,b,c,v[10000005],vi[10000005],f[3005],q=0;
int32_t main(){
CODE_START;
ifstream cin("radixsort.in");
ofstream cout("radixsort.out");
cin>>n>>a>>b>>c;
v[1]=b;
for(int i=2;i<=n;i++)
{
    v[i]=(1ll*a*v[i-1]+b)%c;
}
int t=3;
while(t--){
    for(int i=1;i<=n;i++)
    {
      f[((v[i]>>q)&2047)]++;
    }
    for(int i=1;i<=2047;i++)
    {
        f[i]+=f[i-1];
    }
    for(int i=n;i>=1;i--)
    {
        vi[f[(v[i]>>q)&2047]]=v[i];
        f[(v[i]>>q)&2047]--;
    }
    for(int i=1;i<=n;i++)
    {
        v[i]=vi[i];
    }
    for(int i=0;i<=2047;i++)
    {
        vi[i]=0;
    }
    q+=11;
}
for(int i=1;i<=n;i+=10)
{
    cout<<v[i]<<' ';
}
}