#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define forn(i,a,b) for (int i = a; i <= b; i++)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
#define er erase
#define in insert
#define pi pair <int, int>
#define pii pair <pi, pi>
# define sz(x) (int)((x).size())
#define inf 1000000000
const ll mod = 1000000007;
int n,k,a,b,c,v[10000005],nr,frst=1,mx=INT_MIN;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
void countsort(int x,int exp){
	int output[x],count[10];
	forn(i,0,9)count[i]=0;
	forn(i,1,x)count[(v[i]/exp)%10]++;
	forn(i,1,9)count[i]+=count[i-1];
	for(int i=n;i>0;i--){
		output[count[(v[i]/exp)%10]]=v[i];
		count[(v[i]/exp)%10]--;
	}
	forn(i,1,x)v[i]=output[i];
}
void radsort(int x){
	for(int i=1;mx/i>0;i*=10){
		countsort(x,i);
	}
}
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(); cerr.tie(); cout.tie();

	in>>n>>a>>b>>c;
	v[1]=b; mx=v[1];
	forn(i,2,n){
		v[i]=(a * v[i-1] + b) % c;	
		mx=max(mx,v[i]);
	}
	radsort(n);
	forn(i,1,n){
		if(i%10==1)out<<v[i]<<' ';
	}
	
return 0;
}