#include <iostream>
#include <cstdio>

using namespace std;

int n, a, b, c, col[1000005];

void solve(int a, int b, int c, int poz){
    int st, fin, i=1;
    while(i < n){
        st = min(a, b);
        fin = max(a, b);
        for(int i=st; i<=fin; i++)
            col[i] = c;
        i++;
        a = (a*i)%n;
        b = (b*i)%n;
        c = (c*i)%n;
    }
}

void read(){
    freopen("curcubeu.in","r",stdin);
    scanf("%d%d%d%d",&n,&a,&b,&c);
    solve(a, b, c, 1);
}

int main()
{
    read();
    freopen("curcubeu.out","w",stdout);
    for(int i=1; i<n; i++)
        printf("%d\n",col[i]);
    return 0;
}