#include <fstream>
using namespace std;
ifstream fin ("curcubeu.in");
ofstream fout ("curcubeu.out");
int n,i,j,v[1000001],poz[1000001],a[1000001],b[1000001],c[1000001];
int main()
{
    fin>>n>>a[1]>>b[1]>>c[1];
    for (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 (i=1; i<n; i++)
        poz[i]=i+1;
    for (i=n-1; i>0; i--)
    {
        if (a[i]>b[i])
            swap (a[i],b[i]);
        j=a[i];
        while (j<=b[i])
        {
            if (v[j]==0)
            {
                v[j]=c[i];
                poz[j]=b[i]+1;
                j++;
            }
            else
                j=poz[j];
        }
    }
    for (i=1; i<n; i++)
        fout<<v[i]<<"\n";
    return 0;
}