#include<stdio.h>
long long int modpow(long long int a, long long int n, long long int p)
{
	long long int res = 1;
	for (a %= p; n > 0; n /= 2, a = a * a % p)
		if (n % 2 > 0)
			res = res * a % p;
	return res;
}
void solve()
{
	long long int hc, ac, sc, hg, ag, sg;
	scanf("%lld %lld %lld", &hc, &ac, &sc);
	scanf("%lld %lld %lld", &hg, &ag, &sg);
	const long long int p = 998244353;
	long long int v = (hc - 1) / ag;
	if (v > (hg - 1) / ac)
		v = (hg - 1) / ac;
	hc -= v * ag;
	hg -= v * ac;
	long long int prob, ans = 0, inv = modpow(10, p - 2, p);
	if (hc > ag)
	{
		v = (hc - 1) / ag;
		prob = modpow(inv, v, p);
		ans += (1 - prob + p) % p;
	}
	else
	{
		v = (hg - 1) / ac;
		prob = modpow(inv, v, p);
	}
	if (sc > sg)
	{
		ans += 10 * modpow(11, p - 2, p) % p * prob % p;
		ans %= p;
	}
	else if (sc < sg)
	{
		ans += modpow(11, p - 2, p) * prob % p;
		ans %= p;
	}
	else
	{
		ans += modpow(2, p - 2, p) * prob % p;
		ans %= p;
	}
	printf("%lld\n", ans);
	return;
}
int main()
{
	int t;
	scanf("%d", &t);
	for (; t > 0; t--)
		solve();
	return 0;
}