#include <bits/stdc++.h>
using namespace std;
#define N 1000005
#define MOD 998244353
int T,n,m,c,ans,fc[N],invFc[N];
int qPow(int x,int y)
{int res=1;for(;y;y/=2,x=1ll*x*x%MOD) if(y&1) res=1ll*res*x%MOD;return res;}
void init(int n)
{
	fc[0]=invFc[0]=1;for(int i=1;i<=n;++i) fc[i]=1ll*fc[i-1]*i%MOD;
	invFc[n]=qPow(fc[n],MOD-2);
	for(int i=n-1;i;--i) invFc[i]=1ll*invFc[i+1]*(i+1)%MOD;
}
int bn(int x,int y) {return x<y?0:1ll*fc[x]*invFc[y]%MOD*invFc[x-y]%MOD;}
void slv()
{
	scanf("%d %d %d",&n,&m,&c);if(n>m) swap(n,m);c+=n/2;ans=0;
	if(c<0 || c>n) {printf("0\n");return;}
	for(int i=0,t;i<=n;++i)
	{
		t=i?1ll*bn(n-c-1,(i-1)/2)*bn(c,i/2)%MOD:n==c;
		ans=(ans+1ll*bn((n+m+i)/2,n)*t)%MOD;
	}printf("%d\n",ans);
}
int main() {scanf("%d",&T);init(1e6);while(T--) slv();return 0;}