#include <fstream.h>

long int a, b, c, n, i, j, m, M;
long int v[1000000];

void read(){
ifstream fin ("curcubeu.in");
fin>>n>>a>>b>>c;
fin.close();
}

long int min(long int x, long int y){
if(x<y) return x;
else return y;
}

long int max(long int x, long int y){
if(x>y) return x;
else return y;
}

void solve(){
for(i=1;i<n;i++){
   m=min(a,b);
   M=max(a,b);
   for(j=m;j<=M;j++) v[j]=c;
   a=(a*(i+1))%n;
   b=(b*(i+1))%n;
   c=(c*(i+1))%n;
   }
}

void write(){
ofstream fout ("curcubeu.out");
for(i=1;i<n;i++) fout<<v[i]<<"\n";
fout.close();
}

int main(){
read();
solve();
write();
return 0;
}