from sys import stdin
input=lambda :stdin.readline()[:-1]
from math import gcd
mod=998244353
def lcm(x,y):
  return x//gcd(x,y)*y

def solve():
  x,a,b=map(int,input().split())
  L=lcm(a,b)
  x-=(x-1)//L*L
  if x==L:
    print(1)
    return
  if a==b:
    print(2)
    return
  
  a,b=min(a,b),max(a,b)
  
  y=(L-x)//b
  ans=2*y+1
  nxt_a=(x+a-1)//a*a
  nxt_b=(x+b-1)//b*b
  if nxt_a<nxt_b:
    ans+=1
  if x%a!=0 and x%b!=0:
    ans+=1
  print(ans%mod)

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