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

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

const int dim=1e6+2;
const int mod=1e9+7;

int n,a[dim],b[dim],c[dim];
int sol[dim];
int inv[dim];

int main()
{
    in>>n>>a[1]>>b[1]>>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;
    }
    for(int i=n-1;i>0;i--)
    {
        if(a[i]>b[i])
            swap(a[i],b[i]);
        for(int j=a[i];j<=b[i];++j)
        {
            if(inv[j]==0)
            {
                sol[j]=c[i];
                inv[j]=b[i];
            }
            else j=inv[j];
        }
    }
    for(int i=1;i<n;i++)
        out<<sol[i]<<'\n';
    return 0;
}