from math import gcd

def max_factor(a, b):
    if b == 1: return 0 if a == 1 else a
    while True:
        q, r = divmod(a, b)
        if r: break
        a = q
    while a != 1:
        while True:
            q, r = divmod(b, a)
            if r: break
            if q == 1: return a
            b = q
        q, r = divmod(a, b)
        if r == 0:
            a = q
        else:
            a = gcd(r, b)
            b //= a
    return b

def solve(a, b, c):
    ans = 0
    f = max_factor(a, c)
    ea = ec = 0
    while a % f == 0:
        a //= f
        ea += 1
    while c % f == 0:
        c //= f
        ec += 1
    return ans + ea * b // ec

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