#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream in("radixsort.in");
ofstream out("radixsort.out");

const int N = 1000001;
const int NB = 9;
const int NC = (32 + NB - 1) / NB;
const int B = (1 << NB);
int n, a, b, c, v[N], nr[N], poz[N], aux[N];

int main() {
	in >> n >> a >> b >> c;
	v[0] = b;
	for (int i = 1; i < n; i++) 
		v[i] = (a * v[i - 1] + b) % c;

	int m = B - 1;
	for (int k = 0; k < NC; k++) {
		int nb = k * NB;
		for (int j = 0; j < B; j++)
			nr[j] = 0;
		for (int i = 0; i < n; i++) {
			int cif = (v[i] >> nb)& m;
			nr[cif]++;
		}
		poz[0] = 0;
		for (int j = 0; j < B; j++)
			poz[j] = poz[j - 1] + nr[j - 1];
		for (int i = 0; i < n; i++) {
			int cif = (v[i] >> nb)& m;
			aux[poz[cif]++] = v[i];
		}
		for (int i = 0; i < n; i++)
			v[i] = aux[i];
	}
	for (int i = 0; i < n; i += 10)
		out << v[i] << ' ';
	return 0;
}