#include <stdio.h>
#include <stdlib.h>
#define MAXN 1000000
long long v[MAXN],a[MAXN],b[MAXN],c[MAXN];
int main(){
    FILE*fi,*fout;
    int i,j,n,aux,con;
    fi=fopen("curcubeu.in" ,"r");
    fout=fopen("curcubeu.out" ,"w");
    fscanf(fi,"%d%lld%lld%lld" ,&n,&a[0],&b[0],&c[0]);
    i=1;
    while(i<n-1){
        a[i]=(a[i-1]*(i+1))%n;
        b[i]=(b[i-1]*(i+1))%n;
        c[i]=(c[i-1]*(i+1))%n;
        if(a[i]>b[i]){
            aux=a[i];
            a[i]=b[i];
            b[i]=aux;
        }
        i++;
    }
    i=n-2;
    con=0;
    while(con<n-1){
        for(j=a[i];j<=b[i];j++)
            if(v[j]==0){
                con++;
                v[j]=c[i];
            }
        i--;
    }
    for(i=1;i<n;i++)
        fprintf(fout,"%lld\n" ,v[i]);
    fclose(fi);
    fclose(fout);
    return 0;
}