#include<stdio.h>

const int maxn = 1000000;

int i;
int g[maxn];
int cul[maxn];
int n;
long long a1,b1,c1;
int lim1;
int lim2;
inline int max(int i,int j)
{
        return i > j ? i : j;
}

inline int min(int i,int j)
{
        return i < j ? i : j;
}

int grupa(int i)
{
        if (g[i] != i)
        {
                g[i] = grupa(g[i]);
        }
        return g[i];
}

int reuniune(int i,int j)
{
        g[grupa(i)]  = g[grupa(j)];
}



int main()
{
        freopen("curcubeu.in","r",stdin);
        freopen("curcubeu.out","w",stdout);

        scanf("%d %d %d %d",&n,&a1,&b1,&c1);

        for(i = 1;i <= n; ++i)
        {
                g[i] = i;
        }
        
        for(i =  1;i < n; ++i)
        {
                a1 = ((long long)a1 * i) % n;
                b1 = ((long long)b1 * i) % n;
                c1 = ((long long)c1 * i) % n;
                lim1 = min(a1,b1);
                lim2 = max(a1,b1);
                lim1 = grupa(lim1);
                while(lim1 <= lim2)
                {
                        cul[lim1] = c1;
                        reuniune(lim1,lim1 + 1);
                        lim1 = grupa(lim1);
                }
        }

        for(i = 1;i < n; ++i)
        {
                printf("%d\n",cul[i]);
        }

        return 0;
}