#include<fstream>
#define int long long
using namespace std;

int a[1000007], b[1000007], c[1000007], nxt[1000007], sol[1000007];
ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");
signed main() {
        int n;
        cin >> n >> a[1] >> b[1] >> c[1];
        for (int i = 2; i < n; i++) {
                a[i] = (a[i - 1] * i) % n;
                b[i] = (b[i - 1] * i) % n;
                c[i] = (c[i - 1] * i) % n;
        }
        for (int i = n - 1; i >= 1; i--) {
                for (int j = min(a[i], b[i]); j <= max(a[i], b[i]); j++) {
                        if (nxt[j] == 0) {
                                nxt[j] = max(a[i], b[i]);
                                sol[j] = c[i];
                        }
                        else {
                                j = nxt[j];
                        }
                }
        }
        for (int i = 1; i< n; i++) {
                cout << sol[i] << "\n";
        }
        return 0;
}