//#define NDEBUG #pragma warning(disable : 4146) #include #include #include #include #include #include #include #include #include namespace n91 { using i32 = std::int32_t; using i64 = std::int64_t; using u32 = std::uint32_t; using u64 = std::uint64_t; using isize = std::ptrdiff_t; using usize = std::size_t; using f64 = double; struct rep { struct itr { usize i; constexpr itr(const usize i) noexcept : i(i) {} void operator++() noexcept { ++i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; const itr f, l; constexpr rep(const usize f, const usize l) noexcept : f(std::min(f, l)), l(l) {} constexpr auto begin() const noexcept { return f; } constexpr auto end() const noexcept { return l; } }; struct revrep { struct itr { usize i; constexpr itr(const usize i) noexcept : i(i) {} void operator++() noexcept { --i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; const itr f, l; constexpr revrep(const usize f, const usize l) noexcept : f(l - 1), l(std::min(f, l) - 1) {} constexpr auto begin() const noexcept { return f; } constexpr auto end() const noexcept { return l; } }; template auto md_vec(const usize n, const T& value) { return std::vector(n, value); } template auto md_vec(const usize n, Args... args) { return std::vector(n, md_vec(args...)); } template constexpr T difference(const T& a, const T& b) noexcept { return a < b ? b - a : a - b; } template void chmin(T& a, const T& b) noexcept { if (b < a) a = b; } template void chmax(T& a, const T& b) noexcept { if (a < b) a = b; } template class rec_lambda { F f; public: rec_lambda(F&& f_) : f(std::forward(f_)) {} template auto operator()(Args &&... args) const { return f(*this, std::forward(args)...); } }; template T scan() { T ret; std::cin >> ret; return ret; } constexpr char eoln = '\n'; i64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - static_cast((n ^ d) < 0 && n % d != 0); } i64 ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + static_cast((n ^ d) >= 0 && n % d != 0); } #ifdef N91_LOCAL #define OJ_LOCAL(a, b) b #else #define OJ_LOCAL(a, b) a #endif } // namespace n91 #include namespace noshi91 { namespace floor_sum_impl { using ll = long long; ll floor_sum(ll l, ll r, ll m, ll a, ll b) { assert(l <= r); assert(m != 0); b += a * l; r -= l; if (m < 0) { m *= -1; a *= -1; b *= -1; } ll ans = 0; { const ll q = a / m - static_cast(a < 0 && a % m != 0); a -= q * m; ans += q * (r * (r - 1) / 2); } { const ll q = b / m - static_cast(b < 0 && b % m != 0); b -= q * m; ans += q * r; } return ans + atcoder::floor_sum(r, m, a, b); } } // namespace floor_sum_impl using floor_sum_impl::floor_sum; } // namespace noshi91 namespace n91 { void solve() { const i64 n = scan(); const i64 a = scan(); const i64 b = scan(); i64 ans = 0; ans += noshi91::floor_sum(1, floor_div(n, a) + 1, 1, -a, n); ans += noshi91::floor_sum(1, floor_div(n, b) + 1, 1, -b, n); ans -= noshi91::floor_sum(1, floor_div(n, a) + 1, b, -a, n); std::cout << ans << eoln; } void main_() { const usize t = scan(); for (const usize i : rep(0, t)) { solve(); } } } // namespace n91 int main() { //* std::ios::sync_with_stdio(false); std::cin.tie(nullptr); //*/ std::cout << std::fixed << std::setprecision(20); n91::main_(); return 0; }