#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <climits>
#define NMAX 1000003

using namespace std;


ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");


long long int n, a, b, c;

struct color {
	long long int st, dr, c;
};

color v[NMAX];
int sol[NMAX], nxt[NMAX];

int urmSecv(int poz) {
	int k = poz;
	while (nxt[k] != k)
	{
		k = nxt[k];
	}
	//in k am urm cea mai apropiata secventa
	//fac compresia drumului 
	int aux = poz;
	while (nxt[aux] != aux)
	{
		int nd = aux;
		aux = nxt[aux];
		nxt[nd] = k;
	}
	return k ;
}


void process(int st, int dr, int val)
{
	for (int i = urmSecv(st); i <= dr; i= nxt[i])
	{
		sol[i] = val;
		nxt[i] = urmSecv(i + 1);
	}
}

int main()
{
	fin >> n >> a >> b >> c;
	v[1] = { min(a,b),max(a,b),c };
	nxt[1] = 1;
	for (int i = 2; i <= n; i++)
	{
		a = (a * i) % n;
		b = (b * i) % n;
		c = (c * i) % n;
		v[i] = { min(a,b),max(a,b),c };
		nxt[i] = i;
	}
	//parcurg invers query-urile de colorare
	for(int i=n; i>=1; i--)
	{
		process(v[i].st, v[i].dr, v[i].c);
	}

	for (int i = 1; i < n; i++)
	{
		fout << sol[i] << "\n";
	}
}