#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];


inline ll qmi(ll a, ll b, ll c) { ll res = 1; while (b) { if (b & 1) res = res * a % c; a = a * a % c; b >>= 1; } return res; }

int main() {
	int T;
	cin >> T;
	while (T--) {
		ll a, b, c;
		scanf("%lld%lld%lld", &a, &b, &c);
		ll s = (1 + (a * a + b * b) % MOD * qmi(c * c % MOD, MOD - 2, MOD)) % MOD;
		printf("%lld\n", s);
	}
	return 0;
}