#include <fstream>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
uint32_t *v = new uint32_t[10000000];
int n;

int GetMax()
{
	int maxi = 0;
	for (int i = 0; i < n; i++) if (v[i] > maxi) maxi = v[i];
	return maxi;
}

void CountSort(int exp)
{
	uint32_t *v2, cont[256] = { 0 };
	v2 = new uint32_t[n];
	int i;
	for (i = 0; i < n; i++) cont[(v[i] >> (exp*8)) % 256]++;
	for (i = 1; i < 256; i++) cont[i] += cont[i - 1];
	for (i = n - 1; i >= 0; i--)
	{
		v2[cont[(v[i] >> (exp * 8)) % 256] - 1] = v[i];
		cont[(v[i] >> (exp * 8)) % 256]--;
	}
	for (i = 0; i < n; i++) v[i] = v2[i];
	delete v2;
}

void RadixSort()
{
	int exp;
	int maxi = GetMax();
	for (exp = 0; exp <= 3; exp++)
	{
		CountSort(exp);
	}
}

int main()
{
	int A, B, C;
	in >> n >> A >> B >> C;
	v[0] = B;
	for (int i = 1; i < n; i++) v[i]= (A * v[i - 1] + B) % C;
	RadixSort();
	for (int i = 0; i < n; i+=10) out << v[i]<<' ';
	delete v;
	return 0;
}