MOD = 998244353i64
read_line.to_i.times do
  puts solve()
end

def inv(v : Int64)
  pow(v, MOD - 2)
end

def pow(v : Int64, p)
  ret = 1i64
  while p > 0
    if (p & 1i64) != 0
      ret *= v
      ret %= MOD
    end
    v *= v
    v %= MOD
    p >>= 1
  end
  ret
end

def solve
  h0, a0, s0, h1, a1, s1 = read_line.split.map(&.to_i64)
  c0 = (h0 - 1) // a1
  c1 = (h1 - 1) // a0
  min = {c0, c1}.min
  c0 -= min
  c1 -= min
  if s0 == s1
    if c0 >= c1
      solve_same(c0, c1)
    else
      (MOD + 1 - solve_same(c1, c0)) % MOD
    end
  elsif s0 > s1
    solve_diff(c0, c1)
  else
    (MOD + 1 - solve_diff(c1, c0)) % MOD
  end
end

def solve_same(c0, c1)
  prob = pow(inv(10i64) % MOD, c0 - c1)
  ans = MOD + 1 - prob + prob * inv(2i64)
  ans % MOD
end

def solve_diff(c0, c1)
  prob = pow(inv(10i64) % MOD, (c0 - c1).abs)
  if c0 >= c1
    ans = MOD + 1 - prob
  else
    ans = 0i64
  end
  ans += prob * 10i64 % MOD * inv(11i64)
  ans % MOD
end