#include<fstream>
using namespace std;
int n, i, t, p, a, b, c;
int v[10000001], w[10000001], f[256];
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int cif(int x, int p){
	return ((x >> p) & 255);
}
int main(){
	fin>> n >> a >> b >> c;
	v[1] = b;
	for(i = 2; i <= n; i++){
		v[i] = (a * 1LL * v[i-1] + b) % c;
	}
	for(t = 1; t <= 4; t++){
		for(i = 0; i < 256; i++){
			f[i] = 0;
		}
		for(i = 1; i <= n; i++){
			f[cif(v[i], p)]++;
		}
		for(i = 1; i < 256; i++){
			f[i] += f[i-1];
		}
		for(i = n; i >= 1; i--){
			w[f[cif(v[i], p)]--] = v[i];
		}
		for(i = 1; i <= n; i++){
			v[i] = w[i];
		}
		p+= 8;
	}
	for(i = 1; i <=n; i+= 10){
		fout<< v[i] <<" ";
	}
	return 0;
}