#include <iostream>
#include <fstream>
using namespace std;


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


int n;
int v[1000005];
int ans[1000005];
long long a[1000005];
long long b[1000005];
long long c[1000005];


int main()
{
    fin>>n>>a[1]>>b[1]>>c[1];
    for( int i = 2; i < n; i++ )
    {
        a[i]=(a[i-1]*i)%n;
        b[i]=(b[i-1]*i)%n;
        c[i]=(c[i-1]*i)%n;
    }
    for(int i=n-1;i>0;i--)
    {
        int st=min(a[i],b[i]);
        int dr=max(a[i],b[i]);
        for(int j=st;j<=dr;j++)
        {
            if(v[j]!=0)
            {
                j=v[j];
            }
            else
            {
                v[j]=dr;
                ans[j]=c[i];
            }
        }
    }

    for(int i=1;i<n;i++)
    {
        fout<<ans[i]<<"\n";
    }
    return 0;
}