#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

vector<unsigned> radix_sort(vector<unsigned> data) {

	for(size_t i = 0; i < 32; ++i) {
		queue<unsigned> buckets[2];
		for(const auto &val:data){
			if(val & (1 << i)) {
				buckets[1].push(val);
			}
			else {
				buckets[0].push(val);
			}
		}

		data.clear();

		while(!buckets[0].empty()) {
			data.push_back(buckets[0].front());
			buckets[0].pop();
		}

		while(!buckets[1].empty()) {
			data.push_back(buckets[1].front());
			buckets[1].pop();
		}
	}

	return move(data);
}

int main() {
	ifstream in("radixsort.in");

	unsigned n,a,b,c;

	in >> n >> a >> b >> c;

	vector<unsigned> data(n);
	data[0] = b;

	for(size_t i = 1; i < n; ++i) {
		data[i] = (a*data[i-1] + b)%c;
	}


	data = radix_sort(move(data));

	ofstream out("radixsort.out");

	for(size_t i = 0; i < n; i += 10) {
		out << data[i] << ' ';
	}
}