#include <fstream>
#include <iostream>
#include <vector>
using namespace std;

ifstream f("radixsort.in");
ofstream g("radixsort.out");

const int NMAX = 10000005;
const int BASE = 10;
unsigned int v[NMAX],N;

vector <unsigned int> bucket[BASE+1];

int main()
{
	
	f>>N;

	int A,B,C;
	f>>A>>B>>C;
	
	int i,j,k;
	
	v[1]=B;
	
	unsigned int bestN = v[1];
	for(i=2;i<=N;i++)
	{
		v[i]=(1LL*A*v[i-1]+B)%C;
		bestN=max(v[i],bestN);
	}
	
	for(unsigned int shift=1;shift<=bestN && shift>0; shift*=10)
	{
		for(i=1;i<=N;i++)
			bucket[(v[i]/shift)%BASE].push_back(v[i]);
		
		k=0;
		for(i=0;i<BASE;bucket[i].clear(),i++)
			for(j=0;j<bucket[i].size();j++)
				v[++k]=bucket[i][j];
		
	}
	
	for(i=1;i<=N;i+=10)
		g<<v[i]<<'\n';
	
}