#define maxn 1000003
#include<cstdio>
#include<iostream>
using namespace std;
int a[maxn],b[maxn],c[maxn],i,j,n,m,l,r,sol[maxn],nexxt[maxn];
int main()
{freopen("curcubeu.in","r",stdin);
 freopen("curcubeu.out","w",stdout);
 scanf("%d%d%d%d",&n,&a[1],&b[1],&c[1]);
 for(i=2;i<=n-1;i++)
    {a[i]=((long long )a[i-1]*i)%n;
     b[i]=((long long)b[i-1]*i)%n;
     c[i]=((long long)c[i-1]*i)%n;
    }
    for(i=n-1;i>=1;i--)
    {l=min(a[i],b[i]);
     r=max(a[i],b[i]);
     j=l;
     while(j<=r)
        {if(sol[j]!=0)j=nexxt[j];
            else
            {sol[j]=c[i];
             nexxt[j]=r+1;
             j++;
            }
        }
    }
    for(i=1;i<=n-1;i++)
       printf("%d\n",sol[i]);
}