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

using namespace std;

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

long long n, a, b, c;

int v[10000000];
int r[10000000];

void read() {
	fin >> n >> a >> b >> c;
}
void generate() {
	v[0] = b;
	for (int i = 1; i < n; i++) {
		v[i] = (a*v[i - 1] + b) % c;
	}
}

void sort2() {
	sort(v, v + n);
}

void write() {
	for (int i = 0; i < n; i += 10) {
		fout << v[i] << " ";
	}
}

int main() {
	read();
	generate();
	sort2();
	write();
}