#include <fstream>
#include <queue>
using namespace std;
int n, A, B, C, v[10000100];
queue <int> Q[2][256];

int main()
{
	int i, conf, val, p = 0;
	ifstream fin("radixsort.in");
	fin >> n >> A >> B >> C;
	fin.close();
	
	v[1] = B;
	for(i = 2; i <= n; ++i)
		v[i] = (1LL * A * v[i - 1] + B) % C;
	for(i = 1; i <= n; ++i)
		Q[0][v[i] & 255].push(v[i]);
	for(i = 1; i < 4; ++i, p = 1 - p)
	{
		for(conf = 0; conf < 256; ++conf)
		{
			while(!Q[p][conf].empty())
			{
				val = Q[p][conf].front();
				Q[p][conf].pop();
				Q[1 - p][(val >> (8 * i)) & 255].push(val);
			}
		}
	}
	
	ofstream fout("radixsort.out");
	for(conf = 0, i = 1; conf < 256; ++ conf)
	{
		while(!Q[p][conf].empty())
		{
			val = Q[p][conf].front();
			Q[p][conf].pop();
			if(i % 10 == 1)
				fout << val << ' ';
			i++;
		}
	}
	fout << "\n";
	fout.close();
	return 0;
}