using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var t = NN;
        var ans = new long[t];
        for (var u = 0; u < t; ++u)
        {
            var c = NList;
            var (n, a, b) = (c[0], c[1], c[2]);
            var al = FloorSum(n / a + 1, 1, -a, n) - n;
            var bl = FloorSum(n + 1, b, -1, n) - n / b;
            var abl = FloorSum(n / a + 1, b, -a, n) - n / b;
            ans[u] = al + bl - abl;
        }
        WriteLine(string.Join("\n", ans));
    }
    /// <summary>
    /// sum(x=[0..n); floor((ax + b)/m)) の値を求める<br />
    /// 制約: 0<=n<=10^9, 1<=m<=10^9
    /// </summary>
    static long FloorSum(long _n, long _m, long a, long b)
    {
        var (n, m) = ((ulong)_n, (ulong)_m);
        ulong ans = 0;
        if (a < 0)
        {
            var a2 = (ulong)((a % _m + _m) % _m);
            ans -= n * (n - 1) / 2 * ((a2 + (ulong)- a) / m);
            a = (long)a2;
        }
        if (b < 0)
        {
            var b2 = (ulong)((b % _m + _m) % _m);
            ans -= n * ((b2 + (ulong)- b) / m);
            b = (long)b2;
        }
        return (long)(ans + FloorSum(n, m, (ulong)a, (ulong)b));
    }
    static ulong FloorSum(ulong n, ulong m, ulong a, ulong b)
    {
        ulong ans = 0;
        while (true)
        {
            if (a >= m)
            {
                ans += n * (n - 1) / 2 * (a / m);
                a %= m;
            }
            if (b >= m)
            {
                ans += n * (b / m);
                b %= m;
            }
            ulong yMax = a * n + b;
            if (yMax < m) break;
            n = yMax / m;
            b = yMax % m;
            (m, a) = (a, m);
        }
        return ans;
    }
}