from sys import stdin
input = stdin.readline

def inverse(n, d):
    return n * pow(d, -1, MOD) % MOD

def infinite(a, r):
    # a = 初項 r = 公比
    return inverse(a, 1-r)

def func():
    pass

MOD = 998244353
p10 = pow(10, -1, MOD)
p100 = pow(100, -1, MOD)
half = pow(2, -1, MOD)

for _ in range(int(input())):
    h1, a1, s1, h2, a2, s2 = map(int, input().split())

    MIN = max(min((h1-1)//a2, (h2-1)//a1), 0)
    h1 -= MIN*a2
    h2 -= MIN*a1
    c1 = (h1-1)//a2
    c2 = (h2-1)//a1

    swap = False
    if c1 > c2:
        c1, c2 = c2, c1
        s1, s2 = s2, s1
        swap = True

    ans = -1
    if s1 < s2:
        ans = infinite(pow(p10, c2+1, MOD)*inverse(9, 10)%MOD, p100)
    elif s1 > s2:
        ans = infinite(pow(p10, c2, MOD)*inverse(9, 10)%MOD, p100)
    else:
        ans = pow(p10, c2, MOD)*half%MOD

    if swap:
        ans = (1-ans)%MOD

    print(ans)