#include <cstdio>

const int NMAX = 1000000;

int n;
int a[NMAX], b[NMAX], c[NMAX];
int v[NMAX], skip[NMAX];

int next ( int k )  {
	int p = k;
	while (skip[p] != p) {
		int nx, aux;
		for (nx = p, aux = 0; skip[p] != p && aux < n; nx = skip[nx], ++aux);
		if (aux == n)
			return -1;
		for (int r = p; skip[r] != r; aux = skip[r], skip[r] = nx, r = aux);
		p = nx;
	}
	return p;
}

int main() {
	freopen("curcubeu.in","rt",stdin);
	freopen("curcubeu.out","wt",stdout);
	scanf("%d %d %d %d",&n,&a[1],&b[1],&c[1]);
	for (int 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;
	}
	--n;

	for (int i = 0; i < n; ++i) skip[i] = i;
	bool complete = false;
	for (int k = n; k > 0; --k) {
		if (b[k] < a[k])
			a[k] ^= b[k] ^= a[k] ^= b[k];
		for (int i = next(a[k]-1); i < b[k] && i != -1; i = skip[i]) {
			v[i] = c[k];
			skip[i] = next(i+1);
		}
	}

	for (int i = 0; i < n; ++i)
		printf("%d\n",v[i]);
	return 0;
}