#include <fstream>
#include <algorithm>

using namespace std;

long long  n,a,b,c,v[10000000];

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

int main()
{
	fin >>n>>a>>b>>c;
	v[1]=b;
	for (int i=2;i<=n;i++)
	{
		v[i] = ((a * v[i-1])%c + b) % c;
	}
	sort(v, v+n+1);
	for (int i=1;i<=n;i+=10)
		fout<<v[i]<<' ';

    return 0;
}