#include <fstream>

using namespace std;
ifstream in("curcubeu.in");
ofstream out("curcubeu.out");
const int nmax = 1e6 + 1;
long long A[nmax], B[nmax], C[nmax];
long long nxt[nmax];
long long ok_color[nmax];
long long color[nmax];

int main()
{
    int n;
    in>>n;
    in>>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;
        if(A[i] > B[i])
            swap(A[i],B[i]);
    }
    for(int i = n; i >= 1; i--)///operatiile
    {
        for(int j = A[i]; j <= B[i]; j++)///cutiile
        {

            if(nxt[j] == 0)//if not coloured
            {
                nxt[j] = B[i];
                color[j] = C[i];
            }
            else
                j = nxt[j];
        }
    }
    for(int i = 1; i < n; i++)
        out<<color[i]<<'\n';
    return 0;
}