#include <algorithm>
#include <stdio.h>
#include <vector>

#define MAX 1000010
#define pb push_back

using namespace std;

int nrCase;
int a[MAX], b[MAX], c[MAX], culcasa[MAX];
vector <int> tata, culCasa;

void colCase(int casa, int cul, int lim)
{
	if (casa > lim)
		return;

	if (tata[casa] == casa)
		culCasa[casa] = cul;

	tata[casa] = tata[casa + 1];
	colCase(tata[casa], cul, lim);
	tata[casa] = tata[casa + 1];
}	

int main()
{
	freopen("curcubeu.in", "r", stdin);
	freopen("curcubeu.out", "w", stdout);

	scanf("%d %d %d %d", &nrCase, &a[1], &b[1], &c[1]);

	for (int i = 2; i < nrCase; i++)
	{
		a[i] = (long long) (a[i - 1] * i) % nrCase;
		b[i] = (long long) (b[i - 1] * i) % nrCase;
		c[i] = (long long) (c[i - 1] * i) % nrCase;
	}

	for (int i = 0; i <= nrCase; i++)
	{
		tata.pb(i);
		culCasa.pb(0);
	}

	for (int i = 1; i < nrCase; i++)
		if (a[i] > b[i])
			swap(a[i], b[i]);

	for (int i = nrCase - 1; i; i--)
		colCase(a[i], c[i], b[i]);

	for (int i = 1; i < nrCase; i++)
		printf("%d\n", culCasa[i]);

	fclose(stdin);
	fclose(stdout);
	return 0;
}