#include <fstream>
#include <vector>

using namespace std;

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

int n, a, b, c, v[10000000];

void Sort (int bits) {
	vector < int > h[256];
	for (int i = 0; i < n; i ++)
		h[(v[i] >> bits) & 255].emplace_back (v[i]);
  vector < int > :: iterator it;
	for (int i = 0, n = 0; i < 256; i ++)
		for (it = h[i].begin(); it != h[i].end(); ++it)
			v[n ++] = *it;
}

int main () {
	fin >> n >> a >> b >> c;
	v[0] = b;
	for(int i = 1; i < n; i ++)
		v[i] = ((long long)a * v[i - 1] + b) % c;
	for (int i = 0; i < 32; i += 8)
		Sort (i);
	for (int i = 0; i < n; i += 10)
		fout << v[i] << ' ';
	return 0;
}