#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

class InParser {
private:
	FILE* fin;
	char* buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int& n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		}
		else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long& n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		}
		else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
} fin("radixsort.in");
class OutParser {
private:
	FILE* fout;
	char* buff;
	int sp;

	void write_ch(char ch) {
		if (sp == 50000) {
			fwrite(buff, 1, 50000, fout);
			sp = 0;
			buff[sp++] = ch;
		}
		else {
			buff[sp++] = ch;
		}
	}


public:
	OutParser(const char* name) {
		fout = fopen(name, "w");
		buff = new char[50000]();
		sp = 0;
	}
	~OutParser() {
		fwrite(buff, 1, sp, fout);
		fclose(fout);
	}

	OutParser& operator << (int vu32) {
		if (vu32 <= 9) {
			write_ch(vu32 + '0');
		}
		else {
			(*this) << (vu32 / 10);
			write_ch(vu32 % 10 + '0');
		}
		return *this;
	}

	OutParser& operator << (long long vu64) {
		if (vu64 <= 9) {
			write_ch(vu64 + '0');
		}
		else {
			(*this) << (vu64 / 10);
			write_ch(vu64 % 10 + '0');
		}
		return *this;
	}

	OutParser& operator << (char ch) {
		write_ch(ch);
		return *this;
	}
	OutParser& operator << (const char* ch) {
		while (*ch) {
			write_ch(*ch);
			++ch;
		}
		return *this;
	}
} fout("radixsort.out");

const int nmax = 10'000'000;
const int base = 256;
long long n, a, b, c;
int v[nmax + 1];
int w[nmax + 1];
int frq[base];
int st[base];

int main() {
	fin >> n >> a >> b >> c;
	v[1] = b;
	for (int i = 2; i <= n; ++i) {
		v[i] = (a * v[i - 1] + b) % c;
	}
	int maxValue = *max_element(v + 1, v + n + 1);
	int p = 1;
	while (true) {
		fill_n(frq, base, 0);
		for (int i = 1; i <= n; ++i) {
			frq[(v[i] / p) % base]++;
		}
		st[0] = 1;
		for (int i = 1; i < base; ++i) {
			st[i] = st[i - 1] + frq[i - 1];
		}
		for (int i = 1; i <= n; ++i) {
			w[st[(v[i] / p) % base]++] = v[i];
		}
		swap(v, w);
		if (p > maxValue / base) {
			break;
		}
		p *= base;
	}
	for (int i = 1; i <= n; i += 10) {
		fout << v[i] << " ";
	}
}