#include <cstdio>
#include <algorithm>
using namespace std;
//ifstream f("curcubeu.in");
//ofstream g("curcubeu.out");
const int Nmax=1000002;
int a[Nmax],b[Nmax],c[Nmax],urm[Nmax],cul[Nmax];
 int main(){
    freopen("curcubeu.in","r",stdin); freopen("curcubeu.out","w",stdout);
    int n,m,M;
    //f>>n>>a[1]>>b[1]>>c[1];
    scanf("%d%d%d%d", &n, &a[1], &b[1], &c[1]);
    urm[1]=1;
    for(register int i=2;i<n;i++){
        a[i]=(1LL*a[i-1]*i)%n;
        b[i]=(1LL*b[i-1]*i)%n;
        c[i]=(1LL*c[i-1]*i)%n;
        urm[i]=i;
    }
    for(register int i=n-1;i>0;i--){
        m=a[i]; M=b[i];
        if(m>M) swap(m,M);
        while(m<=M){
            while(m<=M && urm[m]!=m) m=urm[m];
            if(m<=M) cul[m]=c[i], urm[m++]=M+1;
        }
    }
    //for(register int i=1;i<n;++i) g<<cul[i]<<'\n';
    for(register int i=1;i<n;++i) printf("%d\n", cul[i]);
    //g.close();
     return 0;
}