#include<fstream>
#define max(a,b) (((a)>=(b))?(a):(b))
#define min(a,b) (((a)<=(b))?(a):(b))
using namespace std;

int n;
int a[1000005],b[1000005],c[1000005],NEXT[1000005],v[1000005];

int main()
{
    int i,j,inceput,sfarsit;
    ifstream fin("curcubeu.in");
    fin>>n>>a[1]>>b[1]>>c[1];
    fin.close();
    for (i=2;i<=n-1;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;
        }
    for (i=n-1;i>=1;i--)
        {
            inceput=min(a[i],b[i]);
            sfarsit=max(a[i],b[i]);
            for (j=inceput;j<=sfarsit;j++)
            {
                while (NEXT[j] && j<=sfarsit)
                    j=NEXT[j];
                if (j<=sfarsit)
                    {
                        v[j]=c[i];
                        NEXT[j]=sfarsit+1;
                    }
            }
        }
    ofstream fout("curcubeu.out");
    for (i=1;i<=n-1;i++)
        fout<<v[i]<<"\n";
    fout.close();
    return 0;
}