from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right, insort
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

inv10 = pow(10, -1, MOD)
inv11 = pow(11, -1, MOD)
inv2 = pow(2, -1, MOD)
def zero(c, f):
    if c > f:
        return 10*inv11%MOD
    elif f > c:
        return inv11
    else:
        return inv2

for _ in range(int(input())):
    a, b, c, d, e, f = map(int, input().split())
    cnt = min((a-1)//e, (d-1)//b)
    a -= cnt*e
    d -= cnt*b
    a = (a-1)//e
    d = (d-1)//b
    if a > 0:
        ans = 1-pow(inv10, a, MOD)*(1-zero(c, f))
    else:
        ans = pow(inv10, a, MOD)*zero(c, f)
    print(ans%MOD)