from math import gcd
MOD = 998244353

def solve(x, a, b):
    l = a // gcd(a, b) * b
    ma = (x + l - 1) // l * l
    if ma == x:
        return 1
    d = ma - x - 1
    aa = d // a
    bb = d // b
    a_ = (x + a) // a * a
    b_ = (x + b) // b * b
    ret = 2 + min(aa, bb) * 2
    
    if aa == bb:
        pass
    elif a < b:
        if a_ < b_ and x % a != 0:
            ret += 1
    else:
        if b_ < a_ and x % b != 0:
            ret += 1
    return ret
    

for _ in range(int(input())):
    ans = solve(*map(int, input().split()))
    print(ans % MOD)