#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
int a[1000005];
int b[1000005];
int c[1000005];
int next[1000005];
int af[1000005];
int main()
{
    int n;
    f>>n;
    f>>a[1];
    f>>b[1];
    f>>c[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]);
    }
    int L,R;
    for(int i=n;i>=1;i--)
    {
        L=min(a[i],b[i]);
        R=max(a[i],b[i]);
        for(int j=L;j<=R;j++)
        {
            for(int j1=j;j1<=R,next[j]!=0;j1++)
                j=next[j];
            if(j<=R)
            {
                next[j]=R+1;
                af[i]=c[i];
            }
        }

    }
    for(int i=n-1;i>=1;i--)
        g<<af[i]<<"\n";
    return 0;
}