#include <stdio.h>
#include <algorithm>
#define mx 1000010

using namespace std;

int n;
int a[mx], b[mx], c[mx], cul[mx], urm[mx];;

int main()
{
	freopen("curcubeu.in","r",stdin);
	freopen("curcubeu.out","w",stdout);
	scanf("%ld %ld %ld %ld", &n, &a[1], &b[1], &c[1]);
	for (int i = 1; i <= n; urm[i] = i, i++);
	for (int i = 2; i < n; i++)
	{
		a[i] = (i * a[i - 1]) % n;
		b[i] = (i * b[i - 1]) % n;
		c[i] = (i * c[i - 1]) % n;
		if (a[i] > b[i])
			swap(a[i], b[i]);
	}
	for (int i = n - 1; i; i--)
		for (int j = a[i]; j <= b[i]; j = urm[j])
			if (urm[j] == j)
			{
				cul[j] = c[i];
				urm[j] = urm[j + 1];
			}
	for (int i = 1; i < n; printf("%ld\n", cul[i]), i++);
	fclose(stdin);
	fclose(stdout);
	return 0;
}