#include<cstdio>
#define maxn 1000005
#include<iostream>
using namespace std;
int n,nrv;
int a[maxn],b[maxn],c[maxn],t[maxn],ver[maxn];

void solve(){
    for(int i=2;i<n;++i){
        a[i]=((long long)a[i-1]*i)%n;
        b[i]=((long long)b[i-1]*i)%n;   
		c[i]=((long long)c[i-1]*i)%n;
		if(a[i]>b[i])
			swap(a[i],b[i]);
    }
    for(int i=n-1;i>=1 && nrv<=n-1;--i)
        for(int j=a[i];j<=b[i] && nrv<=n-1;)
            if(!t[j])
                t[j]=c[i],nrv++,ver[j]=b[i]+1,j++;
			else
				j=ver[j];
			
}
void afis(){
	for(int i=1;i<n;i++)
		printf("%d\n",t[i]);
}

int main(){
    freopen("curcubeu.in","r",stdin);
    freopen("curcubeu.out","w",stdout);
    scanf("%d %d %d %d",&n,&a[1],&b[1],&c[1]);
    if(a[1]>b[1])
		swap(a[1],b[1]);
	
	solve();
    afis();
    return 0;
}