def floor_sum(n,m,a,b):
    ans=0
    if a>=m:
        ans+=(n-1)*n*(a//m)//2
        a%=m
    if b>=m:
        ans+=n*(b//m)
        b%=m
    y_max=(a*n+b)//m
    x_max=(y_max*m-b)
    if y_max==0:
        return ans
    ans+=(n-(x_max+a-1)//a)*y_max
    ans+=floor_sum(y_max,a,m,(a-x_max%a)%a)
    return ans


def solve(n, a, b):
    na = floor_sum(n // a, 1, a, n - a * (n // a))
    nb = floor_sum(n, b, 1, 0)
    nab = floor_sum(n // a, b, a, n - a * (n // a))
    return (na + nb - nab)

ans = []
for _ in range(int(input())):
    n, a, b = map(int,input().split())
    ans.append(solve(n, a, b))
for v in ans:
    print(v)