#include<fstream>
#include<algorithm>
using namespace std;
int n,A[1000100],B[1000100],C[1000100],next[1000100],v[1000100];

int main()
{
	int i,poz,start,finish,color;
	ifstream fin("curcubeu.in");
	fin>>n>>A[1]>>B[1]>>C[1];
	fin.close();
	
	next[1]=1;
	for(i=2;i<n;i++)
	{
		A[i]=(1LL*A[i-1]*i)%n;
		B[i]=(1LL*B[i-1]*i)%n;
		C[i]=(1LL*C[i-1]*i)%n;
		next[i]=i;
	}
	for(i=n-1;i>0;i--)
	{
		start=A[i];
		finish=B[i];
		if(start>finish)
			swap(start,finish);
		color=C[i];
		poz=start;
		while(poz<=finish)
		{
			while(next[poz]!=poz && poz<=finish)
				poz=next[poz];
			if(poz>finish)
				continue;
			v[poz]=color;
			next[poz]=finish+1;
			poz++;
		}
	}
	
	ofstream fout("curcubeu.out");
	for(i=1;i<n;i++)
		fout<<v[i]<<"\n";
	fout.close();
	return 0;
}