#ifndef HIDDEN_IN_VS // 折りたたみ用

// 警告の抑制
#define _CRT_SECURE_NO_WARNINGS

// ライブラリの読み込み
#include <bits/stdc++.h>
using namespace std;

// 型名の短縮
using ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 = 2e9）
using pii = pair<int, int>;	using pll = pair<ll, ll>;	using pil = pair<int, ll>;	using pli = pair<ll, int>;
using vi = vector<int>;		using vvi = vector<vi>;		using vvvi = vector<vvi>;	using vvvvi = vector<vvvi>;
using vl = vector<ll>;		using vvl = vector<vl>;		using vvvl = vector<vvl>;	using vvvvl = vector<vvvl>;
using vb = vector<bool>;	using vvb = vector<vb>;		using vvvb = vector<vvb>;
using vc = vector<char>;	using vvc = vector<vc>;		using vvvc = vector<vvc>;
using vd = vector<double>;	using vvd = vector<vd>;		using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;

// 定数の定義
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;

// 入出力高速化
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;

// 汎用マクロの定義
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順
#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）
#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定

// 汎用関数の定義
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod

// 演算子オーバーロード
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }

#endif // 折りたたみ用


#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;

#ifdef _MSC_VER
#include "localACL.hpp"
#endif

using mint = modint998244353;
//using mint = static_modint<(int)1e9+7>;
//using mint = modint; // mint::set_mod(m);

using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif


#ifdef _MSC_VER // 手元環境（Visual Studio）
#include "local.hpp"
#else // 提出用（gcc）
int mute_dump = 0;
int frac_print = 0;
#if __has_include(<atcoder/all>)
namespace atcoder {
	inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
	inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
#endif
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_math(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); rep(i,9)cout<<MLE[i]; } } // RE の代わりに MLE を出す
#endif


//【有理数】
/*
* Frac<T>() : O(1)
*	0 で初期化する．
*	制約：T は int, ll, __int128, boost::multiprecision::int256_t 等
*
* Frac<T>(T num) : O(1)
*	num で初期化する．
*
* Frac<T>(T num, T dnm) : O(1)
*	num / dnm で初期化する（分母は自動的に正にする）
*
* a == b, a != b, a < b, a > b, a <= b, a >= b : O(1)
*	大小比較を行う（分母が共通の場合は積はとらない）
*
* a + b, a - b, a * b, a / b : O(1)
*	加減乗除を行う（和と差については，分母が共通の場合は積はとらない）
*	一方が整数でも構わない．複合代入演算子も使用可．
*
* reduction() : O(log min(num, dnm))
*	自身の約分を行う．
*
* together(Frac& a, Frac& b) : O(log min(a.dnm, b.dnm))
*	a と b を通分する．
*
* together(vector<Frac>& as) : O(|as| log dnm)
*	as を通分する．
*
* T floor() : O(1)
*	自身の floor を返す．
*
* T ceil() : O(1)
*	自身の ceil を返す．
*
* Frac absolute() : O(1)
*	自身の絶対値を返す．
*
* bool integerQ() : O(1)
*	自身が整数かを返す．
*/
template <class T = ll>
struct Frac {
	// 分子，分母
	T num, dnm;

	// コンストラクタ
	Frac() : num(0), dnm(1) {}
	Frac(T num) : num(num), dnm(1) {}
	Frac(T num_, T dnm_) : num(num_), dnm(dnm_) {
		// verify : https://atcoder.jp/contests/abc244/tasks/abc244_h

		Assert(dnm != 0);
		if (dnm < 0) { num *= -1; dnm *= -1; }
	}

	// 代入
	Frac(const Frac& b) = default;
	Frac& operator=(const Frac& b) = default;

	// キャスト
	operator double() const { return (double)num / (double)dnm; }

	// 比較
	bool operator==(const Frac& b) const {
		// 分母が等しいときはオーバーフロー防止のために掛け算はせず比較する．
		if (dnm == b.dnm) return num == b.num;
		return num * b.dnm == b.num * dnm;
	}
	bool operator!=(const Frac& b) const { return !(*this == b); }
	bool operator<(const Frac& b) const {
		// verify : https://atcoder.jp/contests/abc308/tasks/abc308_c

		// 分母が等しいときはオーバーフロー防止のために掛け算はせず比較する．
		if (dnm == b.dnm) return num < b.num;
		return (num * b.dnm < b.num * dnm);
	}
	bool operator>=(const Frac& b) const { return !(*this < b); }
	bool operator>(const Frac& b) const { return b < *this; }
	bool operator<=(const Frac& b) const { return !(*this > b); }

	// 整数との比較
	bool operator==(T b) const { return num == b * dnm; }
	bool operator!=(T b) const { return num != b * dnm; }
	bool operator<(T b) const { return num < b * dnm; }
	bool operator>=(T b) const { return num >= b * dnm; }
	bool operator>(T b) const { return num > b * dnm; }
	bool operator<=(T b) const { return num <= b * dnm; }
	friend bool operator==(T a, const Frac& b) { return a * b.dnm == b.num; }
	friend bool operator!=(T a, const Frac& b) { return a * b.dnm != b.num; }
	friend bool operator<(T a, const Frac& b) { return a * b.dnm < b.num; }
	friend bool operator>=(T a, const Frac& b) { return a * b.dnm >= b.num; }
	friend bool operator>(T a, const Frac& b) { return a * b.dnm > b.num; }
	friend bool operator<=(T a, const Frac& b) { return a * b.dnm <= b.num; }

	// 四則演算
	Frac& operator+=(const Frac& b) {
		// verify : https://www.codechef.com/problems/ARCTR

		// 分母が等しいときはオーバーフロー防止のために掛け算はせず加算する．
		if (dnm == b.dnm) num += b.num;
		else { num = num * b.dnm + b.num * dnm; dnm *= b.dnm; }
		return *this;
	}
	Frac& operator-=(const Frac& b) {
		// verify : https://www.codechef.com/problems/ARCTR

		// 分母が等しいときはオーバーフロー防止のために掛け算はせず加算する．
		if (dnm == b.dnm) num -= b.num;
		else { num = num * b.dnm - b.num * dnm; dnm *= b.dnm; }
		return *this;
	}
	Frac& operator*=(const Frac& b) { num *= b.num; dnm *= b.dnm; return *this; }
	Frac& operator/=(const Frac& b) {
		// verify : https://atcoder.jp/contests/abc301/tasks/abc301_g

		Assert(b.num != 0);
		num *= b.dnm; dnm *= b.num;
		if (dnm < 0) { num *= -1; dnm *= -1; }
		return *this;
	}
	Frac operator+(const Frac& b) const { Frac a = *this; return a += b; }
	Frac operator-(const Frac& b) const { Frac a = *this; return a -= b; }
	Frac operator*(const Frac& b) const { Frac a = *this; return a *= b; }
	Frac operator/(const Frac& b) const { Frac a = *this; return a /= b; }
	Frac operator+() const { return Frac(*this); }
	Frac operator-() const { return Frac(*this) *= Frac(-1); }

	// 整数との四則演算
	Frac& operator+=(T c) { num += dnm * c; return *this; }
	Frac& operator-=(T c) { num -= dnm * c; return *this; }
	Frac& operator*=(T c) { num *= c; return *this; }
	Frac& operator/=(T c) {
		Assert(c != T(0));
		dnm *= c;
		if (dnm < 0) { num *= -1; dnm *= -1; }
		return *this;
	}
	Frac operator+(T c) const { Frac a = *this; return a += c; }
	Frac operator-(T c) const { Frac a = *this; return a -= c; }
	Frac operator*(T c) const { Frac a = *this; return a *= c; }
	Frac operator/(T c) const { Frac a = *this; return a /= c; }
	friend Frac operator+(T c, const Frac& a) { return a + c; }
	friend Frac operator-(T c, const Frac& a) { return Frac(c) - a; }
	friend Frac operator*(T c, const Frac& a) { return a * c; }
	friend Frac operator/(T c, const Frac& a) { return Frac(c) / a; }

	// 約分を行う．
	void reduction() {
		// verify : https://atcoder.jp/contests/abc229/tasks/abc229_h

		auto g = gcd(num, dnm);
		num /= g; dnm /= g;
	}

	// a と b を通分する．
	friend void together(Frac& a, Frac& b) {
		// verify : https://atcoder.jp/contests/abc229/tasks/abc229_h

		T dnm = lcm(a.dnm, b.dnm);
		a.num *= dnm / a.dnm; a.dnm = dnm;
		b.num *= dnm / b.dnm; b.dnm = dnm;
	}

	// as を通分する．
	friend void together(vector<Frac>& as) {
		// verify : https://yukicoder.me/problems/617

		T dnm = 1;
		repe(a, as) dnm = lcm(dnm, a.dnm);

		repea(a, as) {
			a.num *= dnm / a.dnm;
			a.dnm = dnm;
		}
	}

	// 自身の絶対値を返す．
	Frac absolute() const {
		// verify : https://atcoder.jp/contests/abc393/tasks/abc393_g

		return Frac(abs(num), dnm);
	}

	// 自身の floor を返す．
	T floor() const {
		// verify : https://www.codechef.com/problems/LINEFIT?tab=statement

		if (num >= 0) return num / dnm;
		else return -((-num + dnm - 1) / dnm);
	}

	// 自身の ceil を返す．
	T ceil() const {
		// verify : https://www.codechef.com/problems/LINEFIT?tab=statement

		if (num >= 0) return (num + dnm - 1) / dnm;
		else return -((-num) / dnm);
	}

	// 自身が整数かを返す．
	bool integerQ() const {
		// verify : https://atcoder.jp/contests/ttpc2022/tasks/ttpc2022_g

		return num % dnm == 0;
	}

#ifdef _MSC_VER
	friend ostream& operator<<(ostream& os, const Frac& a) { os << a.num << '/' << a.dnm; return os; }
#endif
};


// https://github.com/SSRS-cp/yuki2595-bigint-lib/blob/main/bigint.hpp
#include <vector>
#include <string>
#include <atcoder/convolution>
const int DIGIT = 6;
const int BASE = 1000000;
struct positive_bigint {
	std::vector<int> d;
	positive_bigint() {
	}
	positive_bigint(long long X) {
		while (X > 0) {
			d.push_back(X % BASE);
			X /= BASE;
		}
	}
	positive_bigint(std::string S) {
		if (S == "0") {
			S = "";
		}
		int L = S.size();
		d.resize((L + DIGIT - 1) / DIGIT, 0);
		for (int i = L - 1; i >= 0; i -= 6) {
			for (int j = std::max(i - 5, 0); j <= i; j++) {
				d[i / DIGIT] *= 10;
				d[i / DIGIT] += S[j] - '0';
			}
		}
		std::reverse(d.begin(), d.end());
	}
	bool empty() const {
		return d.empty();
	}
	int size() const {
		return d.size();
	}
	int& operator [](int i) {
		return d[i];
	}
	int operator [](int i) const {
		return d[i];
	}
};
std::string to_string(const positive_bigint& A) {
	int N = A.size();
	std::string ans;
	for (int i = N - 1; i >= 0; i--) {
		std::string tmp = std::to_string(A[i]);
		if (i < N - 1) {
			ans += std::string(DIGIT - tmp.size(), '0');
		}
		ans += tmp;
	}
	if (ans.empty()) {
		ans = "0";
	}
	return ans;
}
std::istream& operator >>(std::istream& is, positive_bigint& A) {
	std::string S;
	is >> S;
	A = positive_bigint(S);
	return is;
}
std::ostream& operator <<(std::ostream& os, positive_bigint& A) {
	os << to_string(A);
	return os;
}
int cmp(const positive_bigint& A, const positive_bigint& B) {
	int N = A.size();
	int M = B.size();
	if (N < M) {
		return -1;
	}
	else if (N > M) {
		return 1;
	}
	else {
		for (int i = N - 1; i >= 0; i--) {
			if (A[i] < B[i]) {
				return -1;
			}
			if (A[i] > B[i]) {
				return 1;
			}
		}
		return 0;
	}
}
bool operator ==(const positive_bigint& A, const positive_bigint& B) {
	return cmp(A, B) == 0;
}
bool operator !=(const positive_bigint& A, const positive_bigint& B) {
	return cmp(A, B) != 0;
}
bool operator <(const positive_bigint& A, const positive_bigint& B) {
	return cmp(A, B) < 0;
}
bool operator >(const positive_bigint& A, const positive_bigint& B) {
	return cmp(A, B) > 0;
}
bool operator <=(const positive_bigint& A, const positive_bigint& B) {
	return cmp(A, B) <= 0;
}
bool operator >=(const positive_bigint& A, const positive_bigint& B) {
	return cmp(A, B) >= 0;
}
positive_bigint& operator +=(positive_bigint& A, const positive_bigint& B) {
	int N = A.size();
	int M = B.size();
	while (N < M) {
		A.d.push_back(0);
		N++;
	}
	for (int i = 0; i < M; i++) {
		A[i] += B[i];
	}
	for (int i = 0; i < N - 1; i++) {
		if (A[i] >= BASE) {
			A[i] -= BASE;
			A[i + 1]++;
		}
	}
	if (N > 0) {
		if (A[N - 1] >= BASE) {
			A.d.push_back(1);
			A[N - 1] -= BASE;
		}
	}
	return A;
}
positive_bigint operator +(const positive_bigint& A, const positive_bigint& B) {
	positive_bigint A2 = A;
	A2 += B;
	return A2;
}
positive_bigint& operator -=(positive_bigint& A, const positive_bigint& B) {
	int N = A.size();
	int M = B.size();
	for (int i = 0; i < M; i++) {
		A[i] -= B[i];
	}
	for (int i = 0; i < N - 1; i++) {
		if (A[i] < 0) {
			A[i] += BASE;
			A[i + 1]--;
		}
	}
	while (!A.empty()) {
		if (A.d.back() == 0) {
			A.d.pop_back();
		}
		else {
			break;
		}
	}
	return A;
}
positive_bigint operator -(const positive_bigint& A, const positive_bigint& B) {
	positive_bigint A2 = A;
	A2 -= B;
	return A2;
}
positive_bigint operator *(const positive_bigint& A, const positive_bigint& B) {
	if (A.empty() || B.empty()) {
		return 0;
	}
	int N = A.size();
	int M = B.size();
	std::vector<long long> a(N);
	for (int i = 0; i < N; i++) {
		a[i] = A[i];
	}
	std::vector<long long> b(M);
	for (int i = 0; i < M; i++) {
		b[i] = B[i];
	}
	std::vector<long long> C = atcoder::convolution_ll(a, b);
	for (int i = 0; i < N + M - 2; i++) {
		C[i + 1] += C[i] / BASE;
		C[i] %= BASE;
	}
	if (C[N + M - 2] >= BASE) {
		C.resize(N + M);
		C[N + M - 1] += C[N + M - 2] / BASE;
		C[N + M - 2] %= BASE;
	}
	positive_bigint ans;
	ans.d.resize(C.size());
	for (int i = 0; i < C.size(); i++) {
		ans[i] = C[i];
	}
	return ans;
}
positive_bigint operator *=(positive_bigint& A, const positive_bigint& B) {
	A = A * B;
	return A;
}
struct bigint {
	bool neg = false;
	positive_bigint a;
	bigint() {
	}
	bigint(long long X) : neg(X < 0), a(abs(X)) {
	}
	bigint(const positive_bigint& X, bool neg = false) : neg(neg), a(X) {
	}
	bigint(const std::string& s) {
		if (!s.empty()) {
			if (s[0] == '-') {
				neg = true;
				a = positive_bigint(s.substr(1, s.size() - 1));
			}
			else {
				a = positive_bigint(s);
			}
		}
	}
	bool empty() const {
		return a.empty();
	}
	int size() const {
		return a.size();
	}
	int& operator [](int i) {
		return a[i];
	}
};
std::string to_string(const bigint& A) {
	std::string ans;
	if (A.neg) {
		ans += '-';
	}
	ans += to_string(A.a);
	return ans;
}
std::istream& operator >>(std::istream& is, bigint& A) {
	std::string S;
	is >> S;
	if (S != "0") {
		A = bigint(S);
	}
	return is;
}
std::ostream& operator <<(std::ostream& os, bigint A) {
	os << to_string(A);
	return os;
}
positive_bigint abs(const bigint& A) {
	return A.a;
}
int cmp(const bigint& A, const bigint& B) {
	if (!A.neg) {
		if (!B.neg) {
			return cmp(A.a, B.a);
		}
		else {
			return 1;
		}
	}
	else {
		if (!B.neg) {
			return -1;
		}
		else {
			return cmp(B.a, A.a);
		}
	}
}
bool operator ==(const bigint& A, const bigint& B) {
	return cmp(A, B) == 0;
}
bool operator !=(const bigint& A, const bigint& B) {
	return cmp(A, B) != 0;
}
bool operator <(const bigint& A, const bigint& B) {
	return cmp(A, B) < 0;
}
bool operator >(const bigint& A, const bigint& B) {
	return cmp(A, B) > 0;
}
bool operator <=(const bigint& A, const bigint& B) {
	return cmp(A, B) <= 0;
}
bool operator >=(const bigint& A, const bigint& B) {
	return cmp(A, B) >= 0;
}
bigint operator +(const bigint& A) {
	return A;
}
bigint operator -(const bigint& A) {
	bigint A2 = A;
	if (!A2.empty()) {
		A2.neg = !A2.neg;
	}
	return A2;
}
bigint& operator +=(bigint& A, const bigint& B) {
	if (A.neg == B.neg) {
		A.a += B.a;
	}
	else {
		int c = cmp(A.a, B.a);
		if (c > 0) {
			A.a -= B.a;
		}
		else if (c < 0) {
			A.a = B.a - A.a;
			A.neg = !A.neg;
		}
		else {
			A = 0;
		}
	}
	return A;
}
bigint operator +(const bigint& A, const bigint& B) {
	bigint A2 = A;
	A2 += B;
	return A2;
}
bigint& operator -=(bigint& A, const bigint& B) {
	if (A.neg != B.neg) {
		A.a += B.a;
	}
	else {
		int c = cmp(A.a, B.a);
		if (c > 0) {
			A.a -= B.a;
		}
		else if (c < 0) {
			A.a = B.a - A.a;
			A.neg = !A.neg;
		}
		else {
			A = 0;
		}
	}
	return A;
}
bigint operator -(const bigint& A, const bigint& B) {
	bigint A2 = A;
	A2 -= B;
	return A2;
}
bigint operator *=(bigint& A, const bigint& B) {
	if (A.empty() || B.empty()) {
		A = 0;
	}
	else {
		if (B.neg) {
			A.neg = !A.neg;
		}
		A.a *= B.a;
	}
	return A;
}
bigint operator *(const bigint& A, const bigint& B) {
	bigint A2 = A;
	A2 *= B;
	return A2;
}

using Bint = bigint;


void Main() {
	vl a(3), b(3), c(3), o(3);
	cin >> a >> b >> c >> o;

	vector<Frac<Bint>> A(2), B(2), C(2);
	
	rep(i, 2) {
		A[i] = Frac<Bint>(o[i]) - Frac<Bint>(a[i] - o[i]) * Frac<Bint>(o[2], a[2] - o[2]);
		B[i] = Frac<Bint>(o[i]) - Frac<Bint>(b[i] - o[i]) * Frac<Bint>(o[2], b[2] - o[2]);
		C[i] = Frac<Bint>(o[i]) - Frac<Bint>(c[i] - o[i]) * Frac<Bint>(o[2], c[2] - o[2]);
	}
	dump(A, B, C);

	Frac<Bint> S;
	S += A[0] * B[1];
	S += B[0] * C[1];
	S += C[0] * A[1];
	S -= B[0] * A[1];
	S -= C[0] * B[1];
	S -= A[0] * C[1];
	dump(S);

	string s_num = to_string(abs(S.num));
	string s_dnm = to_string(2 * S.dnm);

	mint num = 0, dnm = 0;
	repe(c, s_num) num = num * 10 + c - '0';
	repe(c, s_dnm) dnm = dnm * 10 + c - '0';

	cout << num / dnm << "\n";
}

int main() {
//	input_from_file("input.txt");
//	output_to_file("output.txt");

	int t = 1;
	cin >> t; // マルチテストケースの場合

	while (t--) {
		dump("------------------------------");
		Main();
	}
}