#include <bits/stdc++.h>
#define pb push_back

using namespace std;

ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");

void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"

typedef pair<int,int> pii;
typedef long long int ll;
typedef long double ld;

const int DMAX = 1e6+10;

int V[4*DMAX];

int n;

void update(int node,int st,int dr,int x,int y,int val);
int query(int node,int st,int dr,int pos);

int main(){
    freopen("curcubeu.in","r",stdin);
    freopen("curcubeu.out","w",stdout);

    int t,i,j;
    int a,b,c;

    scanf("%d%d%d%d",&n,&a,&b,&c);
    for(i=1;i<=n-1;i++){
        a=(1LL*a*i)%n;
        b=(1LL*b*i)%n;
        c=(1LL*c*i)%n;
        update(1,1,n,min(a,b),max(a,b),c);
    }
    for(i=1;i<n;i++)
        printf("%d\n",query(1,1,n,i));

    return 0;
}
void update(int node,int st,int dr,int x,int y,int val){
    if(V[node] && st != dr){
        V[2*node]=V[node];
        V[2*node+1]=V[node];
        V[node]=0;
    }
    if(x <= st && dr <= y){
        V[node]=val;
        return;
    }
    int mij=(st+dr)/2;
    if(x <= mij)
        update(2*node,st,mij,x,y,val);
    if(y > mij)
        update(2*node+1,mij+1,dr,x,y,val);
}
int query(int node,int st,int dr,int pos){
    if(st == dr)
        return V[node];
    if(V[node] && st != dr){
        V[2*node]=V[node];
        V[2*node+1]=V[node];
        V[node]=0;
    }
    int mij=(st+dr)/2;
    if(pos <= mij)
        return query(2*node,st,mij,pos);
    return query(2*node+1,mij+1,dr,pos);
}