/**
	author:  shobonvip
	created: 2025.07.15 19:33:33
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n;
	cin >> n;
	ll a, b, c;
	cin >> a >> b >> c;

	vector<ll> d(2*n, 1e18);
	d[1+n] = a+b;
	priority_queue<pair<ll,int>> pq;
	pq.push(pair(-d[1+n], 1+n));
	while(!pq.empty()) {
		auto [tmp, i] = pq.top();
		pq.pop();
		tmp = -tmp;
		if (tmp > d[i]) continue;
		if (i>=n) {
			if (chmin(d[(i%n+1)%n+n], d[i] + a)) {
				pq.push(pair(-d[(i%n+1)%n+n],(i%n+1)%n+n));
			}
		}else{
			if (chmin(d[(i%n+1)%n+n], d[i] + a + b)) {
				pq.push(pair(-d[(i%n+1)%n+n],(i%n+1)%n+n));
			}
		}
		if (chmin(d[(i%n*2)%n], d[i] + c)) {
			pq.push(pair(-d[(i%n*2)%n],(i%n*2)%n));
		}
	}

	rep(i,0,n) {
		ll v = min(d[0+i],d[n+i]);
		cout<<v<<'\n';
	}
}