#include <fstream>
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
int i,j,n,a[1<<20],b[1<<20],c[1<<20],nxt[1<<20],sol[1<<20];
int main()
{
    f>>n>>a[1]>>b[1]>>c[1];
    if(a[1]>b[1]) swap(a[1],b[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;
        if(a[i]>b[i]) swap(a[i],b[i]);
    }
    for(i=n;i;--i)
        for(j=a[i];j<=b[i];)
        if(sol[j])
        {
            //int lip=j;
            j=nxt[j];
            //nxt[lip]<b[i]+1?nxt[lip]=b[i]+1:nxt[lip]=nxt[lip];
        }
        else
        {
            sol[j]=c[i];
            nxt[j]=b[i]+1;
            ++j;
        }
    for(i=1;i<n;++i) g<<sol[i]<<'\n';
    return 0;
}