#include <bits/stdc++.h>
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
int n, k, x, y,i,j,t[1000005],cul[1000005];

int get_root(int nod) {
    while (nod!=t[nod]) {
        nod=t[nod];
    }
    return nod;
}
int main() {
    fin>>n>>k>>x>>y;
    vector<int>a(n+1),b(n+1),c(n+1);
    a[1]=k;
    b[1]=x;
    c[1]=y;
    if (a[1]>b[1])
            swap(a[1],b[1]);
    for (i=2;i<n;i++) {
        a[2]=(1LL*a[i-1]*i)%n;
        b[2]=(1LL*b[i-1]*i)%n;
        c[2]=(1LL*c[i-1]*i)%n;
        if (a[i]>b[i])
            swap(a[i],b[i]);
    }
    for (i=0;i<=n;i++) {
        t[i]=i;
    }
    for (i=n-1;i>0;i--) {
        x=get_root(a[i]);
        while (x<=b[i]) {
            cul[x]=c[i];
            t[x]=b[i]+1;
            x=get_root(x+1);
        }
    }
    for (i=1;i<n;i++)
        fout<<cul[i]<<"\n";
    return 0;
}