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

using namespace std;

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 a[DMAX];
int b[DMAX];
int c[DMAX];

int ans[DMAX];
int tata[DMAX];
int lg[DMAX];

bool uz[DMAX];

int n;

int findd(int node);
void unire(int x,int y);

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

    int t,i,j;
    int x,y;

    scanf("%d%d%d%d",&n,&a[1],&b[1],&c[1]);

    lg[1]=1;
    for(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;
        lg[i]=1;
    }
    for(i=n-1;i>=1;i--){
        x=min(a[i],b[i]);
        y=max(a[i],b[i]);
        for(;x<=y;x+=lg[x]){
            if(!uz[x]){
                uz[x]=true;
                ans[x]=c[i];
                if(uz[x-1])
                    unire(x-1,x);
                if(uz[x+1])
                    unire(x,x+1);
            }
            x=findd(x);
        }
    }
    for(i=1;i<n;i++)
        printf("%d\n",ans[i]);

    return 0;
}
int findd(int node){
    int ans,aux;
    ans=node;
    while(tata[ans])
        ans=tata[ans];
    while(tata[node]){
        aux=node;
        node=tata[node];
        tata[aux]=ans;
    }
    return ans;
}
void unire(int x,int y){
    x=findd(x);
    y=findd(y);
    if(x == y)
        return;
    tata[y]=x;
    lg[x]+=lg[y];
}