mod = 998244353
inv10 = pow(10, -1, mod)
inv2 = pow(2, -1, mod)

r = 100 * pow(99, -1, mod)
S = 9 * inv10 * r % mod
# 9/10 + 9/10*(1/10)^2 +
# 1/2(9/10 + 1/10 * 9/10) + 
# 同速
SS = 99 * pow(200, -1, mod) * r % mod

ceil = lambda n, d: (n + d - 1) // d
def solve():
    Hc, Ac, Sc, Hg, Ag, Sg = map(int, input().split())
    c_turn = ceil(Hg, Ac)
    g_turn = ceil(Hc, Ag)

    # print(f"{advantage=}, {c_turn=}, {g_turn=}")
    if Sc != Sg:
        advantage = g_turn - c_turn - (1 if Sc < Sg else 0)
        if advantage == 0:
            ans = S
        elif advantage > 0:
            g_tae_prob = pow(inv10, advantage, mod)
            win_prob = (1 - g_tae_prob) % mod

            ans = win_prob + g_tae_prob*S
        else:
            tae_prob = pow(inv10, -advantage, mod)
            ans = tae_prob * S
    else:
        advantage = g_turn - c_turn
        if advantage == 0:
            ans = SS
        elif advantage > 0:
            g_tae_prob = pow(inv10, advantage, mod)
            win_prob = (1 - g_tae_prob) % mod

            ans = win_prob + g_tae_prob*SS
        else:
            tae_prob = pow(inv10, -advantage, mod)
            ans = tae_prob * SS

    print(ans%mod)


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