#include <fstream>
using namespace std;

ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");

int n;
int A[1000000], B[1000000], C[1000000];
int p[1000000];
int viz[1000000];

int main()
{
    p[1] = 1;
    cin >> n >> A[1] >> B[1] >> C[1];
    for(int 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;
        p[i] = i;
    }
    p[n] = 0;

    for(int i = n-1; i>0; i--)
    {
        int st = min(A[i], B[i]);
        int dr = max(A[i], B[i]);

        for(int j = st; j <= dr && j<n;)
        {
            if(viz[j] == 0)
            {
                viz[j] = C[i];
                p[j] = dr + 1;
                j++;
            }
            else
                j = p[j];
        }
    }

    for(int i = 1; i<n; i++)
    {
        cout << viz[i] << '\n';
    }
}