#include <fstream>

using namespace std;

ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");

const int nmax = 1000005;

int n, a, b, c, A[nmax], B[nmax], C[nmax], sol[nmax], N[nmax];
int main()
{
    fin >> n >> a >> b >> c;
    if(a > b)
        swap(a, b);
    A[1] = a, B[1] = b, C[1] = c;
    for(int i = 2; i <= n; ++i)
    {
        a = (1LL*a* i) % n;
        b = (1LL*b* i) % n;
        c = (1LL*c* i) % n;
        if(a > b)
            swap(a, b);
        A[i] = a, B[i] = b, C[i] = c;
    }
    for(int i = n - 1; i >= 1; i--)
    {
        for(int j = A[i]; j <= B[i]; ++j)
        {
            while(N[j] != 0)
                j = N[j];
            if(j <= B[i])
            {
                N[j] = B[i] + 1;
                sol[j] = C[i];
            }
            else
                break;
        }
    }
    for(int i = 1; i < n; ++i)
        fout << sol[i] << "\n";
    return 0;
}