from fractions import Fraction

MOD = 998244353


def power(p, e):
    return pow(p, e, MOD)


# def power(p, e):
#     if e < 0:
#         return Fraction(1, power(p, -e))
#     return pow(p, e)


def solve():
    H1, A1, S1, H2, A2, S2 = [int(s) for s in input().split()]

    cnt1 = (H1 - 1) // A2
    cnt2 = (H2 - 1) // A1

    min_times = min(cnt1, cnt2)

    cnt1 -= min_times
    cnt2 -= min_times

    ans = 0

    if cnt1 > cnt2:
        ans += 1 - power(10, -cnt1)

    p = power(10, -max(cnt1, cnt2))

    if S1 > S2:
        ans += p * 9 * power(10, -1) * power(1 - power(100, -1), -1)
    elif S1 < S2:
        ans += p * 9 * power(100, -1) * power(1 - power(100, -1), -1)
    else:
        ans += p * power(2, -1)

    ans %= MOD

    print(ans)


# dp[n] = 1/10 * 9/10 * dp[n+1]
# dp[n] = 9/100 dp[n+1]

# x = 1/2 * (1/10 * 9/10 + 1/10 * 1/10 * x) + 1/2 * (9/10 + 1/10 * 1/10 * x)
# x = 9/100 + 1/100 * x
# 99/100 * x = 9/100
# x = 1/11


if __name__ == "__main__":
    T = int(input())

    for _ in range(T):
        solve()