#include <fstream>
#include <algorithm>
#define LL long long
using namespace std;
ifstream f("curcubeu.in"); ofstream g("curcubeu.out");
int cul[1000002];
int main()
{   int n,a,b,c,i,j,m,M;
    f>>n>>a>>b>>c; 
	m=min(a,b); M=max(a,b); 
	for(j=m;j<=M;++j) cul[j]=c;
	for(i=2;i<n;++i)
	{	a=(LL)a*i%n; b=(LL)b*i%n; c=(LL)c*i%n;
		m=min(a,b); M=max(a,b); 
		for(j=m;j<=M;++j) cul[j]=c;
	}
	for(i=1;i<n;++i) g<<cul[i]<<'\n';
	g.close(); return 0;
}