#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

int main()
{
    int n, a, b, c, minim, maxim;

    in.sync_with_stdio(false);
    in >> n >> a >> b >> c;

    vector<int> dp(n + 1);

    for (int i = 1; i < n; i++)
    {
        a = (1LL * a * i) % n;
        b = (1LL * b * i) % n;
        c = (1LL * c * i) % n;

        minim = min(a, b);
        maxim = max(a, b);
        for (int j = minim; j <= maxim; j++)
            dp[j] = c;
    }

    for (int i = 1; i < n; i++)
        out << dp[i] << '\n';

    return 0;
}