# https://atcoder.jp/contests/practice2/submissions/27906724
# ↑ Shirotsume さんありがとう

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=map(int,input().split())
  ans=0
  ma=n//a
  ans+=(ma)*n-a*(ma)*(ma+1)//2
  #print(ans)

  mb=n//b
  ans+=(mb)*n-b*(mb)*(mb+1)//2
  #print(ans)

  # count (a,b) such that ax+by<=n
  s=n%b
  t=(n-s)//b
  ans-=floor_sum(t,a,b,s)
  print(ans)

for _ in range(int(input())):
  solve()