#include <fstream>

using namespace std;

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

const int N = (int)1e6 + 7;

int n;
int a[N];
int b[N];
int c[N];

int r[N];

int urm[N];

int main()
{
        cin >> n;
        cin >> a[1] >> b[1] >> c[1];
        for(int i = 2; i < n; i++)
        {
                a[i] = a[i - 1] * (long long)i % n;
                b[i] = b[i - 1] * (long long)i % n;
                c[i] = c[i - 1] * (long long)i % n;
        }
        for(int i = 1; i < n; i++)
        {
                r[i] = -1;
        }
        for(int i = n - 1; i >= 1; i--)
        {
                int st = min(a[i], b[i]);
                int dr = max(a[i], b[i]);
                int kol = c[i];
                for(int j = st; j <= dr;)
                {
                        if(r[j] == -1)
                        {
                                r[j] = kol;
                                urm[j] = dr + 1;
                                j++;
                        }
                        else
                        {
                                j = urm[j];
                        }
                }
        }
        for(int i = 1; i < n; i++)
        {
                r[i] = max(0, r[i]);
                cout << r[i] << "\n";
        }
        return 0;
}