/*
 飞过天际 走到海角 要拾回快乐
 双手摸索 双眼搜索 我尚有感觉
 心似刀割 总算醒觉 胜地难闭幕
 失去感觉 失去知觉 我尚有躯壳
 */
#include <bits/stdc++.h>

using namespace std;

using ull = unsigned long long;

// https://loj.ac/s/498386
namespace loj6677 {

const int N = 6000054, mod = 998244353;

int fact[N], finv[N];
int pact[N], pinv[N];

ull PowerMod(ull a, int n, ull c = 1) {for (; n; n >>= 1, a = a * a % mod) if (n & 1) c = c * a % mod; return c;}

void init(int n) {
	int i;
	for (*fact = i = 1; i <= n; ++i) fact[i] = (ull)fact[i - 1] * i % mod;
	finv[n] = PowerMod(fact[n], mod - 2);
	for (i = n; i; --i) finv[i - 1] = (ull)finv[i] * i % mod;
	for (*pact = i = 1; i <= n; ++i) pact[i] = (ull)pact[i - 1] * fact[i] % mod;
	pinv[n] = PowerMod(pact[n], mod - 2);
	for (i = n; i; --i) pinv[i - 1] = (ull)pinv[i] * fact[i] % mod;
}

int query(int a, int b, int c) {
	if (!a || !b || !c) return 1;
	return (ull)pact[a + b + c - 1] * pinv[a + b - 1] % mod * pinv[b + c - 1] % mod * pinv[c + a - 1] % mod * pact[a - 1] % mod * pact[b - 1] % mod * pact[c - 1] % mod;
}

}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);

	int T; cin >> T;
	loj6677::init(6e6);
	while (T--) {
		int x, y, z; cin >> x >> y >> z;
		if (x < y) swap(x, y);
		if (x < z) swap(x, z);
		x = min(x, y + z);
		int A = x + y - z, B = y + z - x, C = z + x - y;
		ull ans1 = A * (ull)B + B * (ull)C + C * (ull)A;
		cout << ans1 << ' ' << loj6677::query(A, B, C) << '\n';
	}
	
	return 0;
}