#include <fstream>
#define Nmax 1000005
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
int n,sol[Nmax];
int A[Nmax],B[Nmax],C[Nmax],next[Nmax];
int main()
{
    int i,a,b,c,j;
    fin>>n>>a>>b>>c;
    if(a>b) swap(a,b);
    A[1] = a; B[1] = b; C[1] = c;
    for(i=2;i<n;i++)
    {
        a = (a*i)%n;
        b = (b*i)%n;
        c = (c*i)%n;
        if(a>b) swap(a,b);
        A[i] = a; B[i] = b; C[i] = c;
    }
    for(i=n-1;i>=1;i--)
    {
        j = A[i];
        while(j<=B[i])
        {
            if(next[j]!=0) j = next[j];
            else sol[j] = C[i];
            j++;
        }
        next[A[i]] = B[i];
    }
    for(i=1;i<n;i++) fout<<sol[i]<<"\n";



    fout.close();
    return 0;
}