#include<fstream>
using namespace std;
ifstream fn("curcubeu.in");
ofstream ft("curcubeu.out");
#define maxn 100000
int n,a[maxn],b[maxn],c[maxn],i,j,k,aux,l[maxn],v[maxn];
int main()
{
    fn>>n>>a[1]>>b[1]>>c[1];
    for(i=2;i<n;++i)
    a[i]=((long long)a[i-1]*i)%n,b[i]=((long long)b[i-1]*i)%n,c[i]=((long long)c[i-1]*i)%n;
    for(i=n-1;i;--i)
    {   k=0;
        if(a[i]>b[i])
            aux=a[i],a[i]=b[i],b[i]=aux;
        for(j=a[i];j<=b[i];++j)
        {
            k=j;
            while(v[j])
                j=l[j]+1;
            while(k!=j)
                aux=l[k],l[k]=j-1,k=aux+1;
            if(j<=b[i])
            {
                v[j]=c[i];
                l[j]=b[i];
            }
        }
    }
    for(i=1;i<n;++i)
        ft<<v[i]<<"\n";
}