//
//  main.cpp
//  balul bobocilor
//
//  Created by Eusebiu Rares on 14/09/2020.
//  Copyright © 2020 Eusebiu Rares. All rights reserved.
//

#include <iostream>
#include "fstream"
#include "vector"
#include "algorithm"

std::fstream in ("curcubeu.in", std::ios::in) ;
std::fstream out ("curcubeu.out", std::ios::out) ;

const int MV = 2e6 ;
using i64 = long long ;

struct Query {
	int left, right ;
	int value ;
	Query() {
		this -> left = this -> right = this -> value = -1 ;
	}
	Query(int _left, int _right, int _value) {
		this -> left = _left ;
		this -> right = _right ;
		this -> value = _value ;
	}
} ;

std::vector<Query> querys ;
int sol[MV + 1] ;
int jump[MV + 1] ;

int main(int argc, const char * argv[]) {
	int n, A, B, C, i, position ;
	in >> n >> A >> B >> C ;
	
	querys.push_back(Query(std::min(A, B), std::max(A, B), C)) ;
	for (i = 2 ; i <= n - 1 ; ++ i) {
		A = ((i64)A * i) % n ;
		B = ((i64)B * i) % n ;
		C = ((i64)C * i) % n ;
		querys.push_back(Query(std::min(A, B), std::max(A, B), C)) ;
	}
	
	std::reverse(querys.begin(), querys.end()) ;
	
	for (Query currentQuery : querys) {
		for (position = currentQuery.left ; position <= currentQuery.right ; ) {
			if (sol[position] != 0) {
				position = jump[position] ;
			} else {
				sol[position] = currentQuery.value ;
				jump[position] = currentQuery.right + 1 ;
				position ++ ;
			}
		}
	}
	
	for (i = 1 ; i <= n - 1 ; ++ i) {
		out << sol[i] << '\n' ;
	}
}