def floor_sum(n,m,a,b):
    #Σ i=0→(n-1) [(a*i+b)/m]をO(loga+logm)で求める 1<=n,m  a,bはall
    if not(0<=a<m and 0<=b<m):
        k=(a-a%m)//m
        l=(b-b%m)//m
        return floor_sum(n,m,a%m,b%m)+(l)*n+(k)*n*(n-1)//2

    if a==0:
        return (b//m)*n
    if n==1:
        return b//m
    if a>=m or b>=m:
        return floor_sum(n,m,a%m,b%m)+(b//m)*n+(a//m)*n*(n-1)//2
    y=(a*n+b)//m
    z=(a*n+b)%m
    return floor_sum(y,a,m,z)






T=int(input())
for _ in range(T):
    n,a,b=map(int,input().split())
    cnt=n//a
    ansa=(cnt)*(n-a-a*cnt+n)//2
    cnt=n//b
    ansb=(cnt)*(n-b-b*cnt+n)//2
    ansab=floor_sum(n//a+1,b,-a,n)-n//b
    ans=ansa+ansb-ansab

    print(ans)