#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int n,a[1000005],b[1000005],c[1000005],nxt[1000005],ans[1000005];
int32_t main(){
//CODE_START;
ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");
cin>>n>>a[1]>>b[1]>>c[1];
if(a[1]>b[1]){
    swap(a[1],b[1]);
}
for(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;
    if(a[i]>b[i]){
        swap(a[i],b[i]);
    }
}
for(int i=n-1;i>=1;i--)
{
    for(int j=a[i];j<=b[i];){
        if(ans[j]==0){
            ans[j]=c[i];
            nxt[j]=b[i]+1;
            j++;
        }else j=nxt[j];
    }
}
for(int i=1;i<n;i++)
{
    cout<<ans[i]<<'\n';
}
}