#include<fstream>
#include<algorithm>
#define Nmax 1000000
using namespace std;

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

long A[Nmax], B[Nmax], C[Nmax], culori[Nmax];
long i, j;

int main()
{
	long N, st, dr;
	fin >> N;
	fin >> A[1] >> B[1] >> C[1];
	for (i = 2; i < N; ++i)
	{
		A[i] = (A[i - 1] * i)%N;
		B[i] = (B[i - 1] * i)%N;
		C[i] = (C[i - 1] * i)%N;
	}
	for (i = 1; i < N; ++i)
	{
		st = min(A[i], B[i]);
		dr = max(A[i], B[i]);
		for (j = st; j <= dr; ++j)
			culori[j] = C[i];
	}
	for (i = 1; i < N; ++i)
		fout << *(culori+i)<< '\n';
	fin.close();
	fout.close();
	return 0;
}