#include <fstream>
#include <array>

using namespace std;

const int MAXN = 10000000;

array<uint, MAXN> v;
array<uint, MAXN> temp;

void radixsort(array<uint, MAXN> &vect)
{	
	array<uint, 256> buckets;

	for (uint round = 0, step = 0; round < sizeof(uint); round++, step += 8) {
		buckets.fill(0);

		for (auto v : vect) {
			buckets[(v >> step) & 255]++;
		}

		for (uint i = 1; i < buckets.size(); i++)
			buckets[i] += buckets[i-1];

		for (int i = vect.size()-1; i != -1; i--)
		{
			uint b = (vect[i] >> step) & 255;
			buckets[b]--;
			temp[buckets[b]] = vect[i];
		}

		temp.swap(vect);
	}

}


int main(int argc, char const *argv[])
{
	ifstream fin("radixsort.in");
	ofstream fout("radixsort.out");

	unsigned long long N, A, B, C;
	fin >> N >> A >> B >> C;

	v[0] = B;
	for (uint i = 1; i < N; i++)
	{
		v[i] = ((((A * v[i-1]) % C + B) % C));
	}

	radixsort(v);
	for (uint i = 0; i < N; i += 10)
		fout << v[i] << ' ';

	return 0;
}