#include <stdio.h>
#include <algorithm>
using namespace std;

#define Nmax 1000005

int a[Nmax], b[Nmax], c[Nmax], next[Nmax], clr[Nmax];
int n;

void read(){
	freopen("curcubeu.in", "r", stdin);
	scanf("%d %d %d %d", &n, a + 1, b + 1, c + 1);

	if (a[1] > b[1])
		swap(a[1], b[1]);
	for (int i = 2; i <= n - 1; ++i){
		a[i] = (a[i - 1] * i) % n;
		b[i] = (b[i - 1] * i) % n;
		c[i] = (c[i - 1] * i) % n;
		if (a[i] > b[i])
			swap(a[i], b[i]);
	}

	fclose(stdin);
}

void solve(){
	for (int i = n - 1; i >= 1; --i){
		for (int j = a[i]; j <= b[i];){
			if (!next[j]){
				clr[j] = c[i];
				next[j] = (next[ b[i] + 1 ]) ? next[ b[i] + 1 ] : b[i] + 1;
				++j;
			} else
				j = next[j];
		}
	}
}

void write(){
	freopen("curcubeu.out", "w", stdout);
	for (int i = 1; i <= n - 1; ++i)
		printf("%d\n", clr[i]);
	fclose(stdout);
}

int main(){
	read();
	solve();
	write();
}