#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <cstdio>
#include <cassert>
using namespace std;
typedef long long ll;

vector<int>parent, sol;
int n, m, mx = 0;
vector<pair<int, int>>v, q;

int get_root(int nod) {
	if (parent[nod] == nod)
		return nod;
	return parent[nod] = get_root(parent[nod]);
}
void merge(int x, int y) {
	x = get_root(x);
	y = get_root(y);
	if (x != y)
	{
		if (x > y)
			parent[y] = x;
		else
			parent[y] = x;
	}
}
void make_root(int nod) {
	parent[nod] = nod;
}


struct interval {
	int a, b, c;
};
signed main()
{
#ifdef INFOARENA
	freopen("curcubeu.in", "r", stdin);
	freopen("curcubeu.out", "w", stdout);
#endif

	int n, a, b, c;
	cin >> n >> a >> b >> c;
	sol.resize(n + 1, -1);
	parent.resize(n + 1, 0);
	
	vector<interval>pas;
	for (int i = 1; i <= n - 1; i++) {
		a = (1LL * a * i) % n;
		b = (1LL * b * i) % n;
		c = (1LL * c * i) % n;
		interval it;
		it.a = a;
		it.b = b;
		it.c = c;
		pas.push_back(it);
	}
	for (int i = pas.size() - 1; i >= 0; i--) {
		int start = min(pas[i].a, pas[i].b);
		while (start <= max(pas[i].a, pas[i].b)) {
			if (sol[start] == -1)
			{
				sol[start] = pas[i].c;
				make_root(start);
				if(start+1<=n-1)
					merge(start, start + 1);
				start++;
			}
			else {
				start = get_root(start) + 1;
			}
		}
		
	}
	for (int i = 1; i <= n - 1; i++) {
		cout << sol[i] << "\n";
	}
}