from math import gcd

def pseudo_primes(a):
    primes = []
    for x in a:
        np = []
        def f(x, y):
            if x == 1:
                return y
            while y % x == 0:
                y //= x
            g = gcd(x, y)
            if g == 1:
                np.append(x)
                return y
            x //= g
            y //= g
            g = f(x, g)
            return f(g, y)
        for p in primes:
            x = f(p, x)
        if x != 1:
            np.append(x)
        primes = np
    return primes

def solve(a, b, c):
    mea, mec = 1, 0
    for p in pseudo_primes([a, c]):
        ea = ec = 0
        while a % p == 0:
            a //= p
            ea += 1
        while c % p == 0:
            c //= p
            ec += 1
        if ea == 0:
            assert ec > 0
            return 0
        if ec * mea > mec * ea:
            mea, mec = ea, ec
    assert a == c == 1
    return ea * b // ec

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