#include <bits/stdc++.h>

using namespace std;

#define lli long long int

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

const int MAXN = 1e7;
const int chunkSize = 4;
const int chunkCnt = 32 / chunkSize;

int n;
vector<int> v;

void read() {
	int a, b, c;
	in >> n >> a >> b >> c;
	v.resize(n);

	v[0] = b;
	for (int i = 1; i < n; ++ i)
		v[i] = (1LL * a * v[i - 1] + b) % c;
}

vector<int> result;
void countSort(vector<int> &nums, int chunk) {
	vector<int> index(1 << chunkSize), count(1 << chunkSize);

	for (auto &x : nums)
		++ count[(x >> (chunkSize * chunk)) & 0xF];
	
	index[0] = 0;
	for (int i = 1; i < index.size(); ++ i)
		index[i] = index[i - 1] + count[i - 1];

	result.clear();
	result.resize(nums.size());
	for (auto &x : nums)
		result[index[(x >> (chunkSize * chunk)) & 0xF] ++] = x;

	nums = result;
}

void radixSort() {
	for (int i = 0; i < chunkCnt; ++ i)
		countSort(v, i);
}

void writeAns() {
	for (int i = 0; i < v.size(); i += 10)
		out << v[i] << ' ';
}

int main() {
	read();
	radixSort();
	writeAns();

	return 0;
}