// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
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_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_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::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
// ---------- begin floor sum ----------
// sum_{i = 0}^{n - 1} floor((ai + b) / m)
pub fn floor_sum(n: u64, m: u64, mut a: u64, mut b: u64) -> u64 {
    assert!(n <= 10u64.pow(9));
    assert!(1 <= m && m <= 10u64.pow(9));
    let mut ans = 0;
    ans += a / m * n * (n - 1) / 2 + b / m * n;
    a %= m;
    b %= m;
    let p = a * n + b;
    if p >= m {
        ans += floor_sum(p / m, a, m, p % m);
    }
    ans
}
// ---------- end floor sum ----------
use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

// sum_i max (0, N - ai)
// sum_i max (0, N - bi)
// - (交点)
//
// 交点
// sum_i floor((N - ai) / b)
//

fn run() {
    input! {
        t: usize,
        ask: [(u64, u64, u64); t],
    }
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    for (n, a, b) in ask {
        let mut ans = 0;
        let x = n / a;
        ans += n * x - a * x * (x + 1) / 2;
        let y = n / b;
        ans += n * y - b * y * (y + 1) / 2;
        let s = n - x * a;
        ans -= floor_sum(x, b, a, s);
        writeln!(out, "{}", ans).ok();
    }
}

fn main() {
    run();
}