import math

mod = 998244353

def ceil_div(x, y):
    return (x+y-1)//y

def solve(x, a, b):
    if a == b:
        if x%a == 0:
            return 1
        else:
            return 2
    lcm = math.lcm(a, b)
    r = ceil_div(x, lcm)*lcm
    ans = (r//b - (x-1)//b)*2
    # print(f"{r=} {ans=} {lcm=} {r=}")
    next_a = ceil_div(x, a)*a
    next_b = ceil_div(x, b)*b
    
    if next_a >= next_b:
        ans -= 1
    
    if x%a != 0 and x%b != 0:
        ans += 1
    return ans%mod


t = int(input())

for _ in range(t):
    x, a, b = map(int, input().split())
    if a > b:
        a, b = b, a
    print(solve(x, a, b))