use std::io::Write; fn run() { input!(n: usize, a: u64, b: u64, c: u64); let f = |mut x: usize| -> usize { if x >= n { x -= n; } x }; let inf = std::u64::MAX; let mut dp = vec![vec![inf; n]; 2]; dp[1][1] = a + b; let mut pq = std::collections::BinaryHeap::new(); pq.push((!dp[1][1], 1, 1)); while let Some((d, x, y)) = pq.pop() { let d = !d; if d > dp[x][y] { continue; } let ny = f(2 * y); if dp[0][ny].chmin(d + c) { pq.push((!(d + c), 0, ny)); } let ny = f(y + 1); if x == 0 { if dp[1][ny].chmin(d + a + b) { pq.push((!(d + a + b), 1, ny)); } } else { if dp[1][ny].chmin(d + a) { pq.push((!(d + a), 1, ny)); } } } let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); for i in 0..n { writeln!(out, "{}", dp[0][i].min(dp[1][i])).ok(); } } fn main() { run(); } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- // ---------- begin chmin, chmax ---------- pub trait ChangeMinMax { fn chmin(&mut self, x: Self) -> bool; fn chmax(&mut self, x: Self) -> bool; } impl ChangeMinMax for T { fn chmin(&mut self, x: Self) -> bool { *self > x && { *self = x; true } } fn chmax(&mut self, x: Self) -> bool { *self < x && { *self = x; true } } } // ---------- end chmin, chmax ----------