use std::io::Write; fn run() { input! { t: usize, ask: [(u128, u128, u128); t], } let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); for (x, a, b) in ask { let ans = solve(x, a, b) % 998244353; writeln!(out, "{}", ans).ok(); } } fn solve(x: u128, mut a: u128, mut b: u128) -> u128 { let next = |x, a| -> u128 { (x + a - 1) / a * a }; if a > b { std::mem::swap(&mut a, &mut b); } let mut ans = 1; let mut x = x; let lcm = lcm(a, b); let finish = next(x, lcm); let p = next(x, a); let q = next(x, b); if (p == x || q <= p) && q > x { ans += 1; x = q; } else if p < q && p > x { ans += 1; x = p; let q = next(x, b); if q > x { x = q; ans += 1; } } ans + (finish - x) / b * 2 } fn lcm(a: u128, b: u128) -> u128 { a * b / binary_gcd(a, b) } 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 binary_gcd ---------- pub fn binary_gcd(a: u128, b: u128) -> u128 { if a == 0 || b == 0 { return a + b; } let x = a.trailing_zeros(); let y = b.trailing_zeros(); let mut a = a >> x; let mut b = b >> y; while a != b { let x = (a ^ b).trailing_zeros(); if a < b { std::mem::swap(&mut a, &mut b); } a = (a - b) >> x; } a << x.min(y) } // ---------- end binary_gcd ----------