#include <bits/stdc++.h>
#define il inline
using namespace std;
typedef long long ll;
const ll mod=998244353;
il ll qp(ll a,ll b){
    ll ans=1ll;
    while(b){
        if(b&1) ans=(ans*a)%mod;
        a=(a*a)%mod,b>>=1;
    }return ans;
}
const int N=2e6+5;
int T,a,b,c,inv[N],f[N],g[N];
il void init(){
    int n=N-5;ll x=1ll;f[0]=g[0]=1ll;for(int i=1;i<=n;++i) x=(x*1ll*i)%mod,f[i]=(f[i-1]*x)%mod;
    inv[n]=qp(x,mod-2ll);for(int i=n-1;i>=0;--i) inv[i]=(inv[i+1]*(i+1ll))%mod;
    for(int i=1;i<=n;++i) g[i]=(1ll*g[i-1]*inv[i])%mod;
}
ll x,y,z;int u,v,w;
int main(){
    scanf("%d",&T);init();
    while(T--){
        scanf("%d%d%d",&a,&b,&c);
        if(a>b) swap(a,b);if(b>c) swap(b,c);if(a>b) swap(a,b);
        u=a+b-c,v=c+a-b,w=b+c-a;
        if(u<=0){printf("%lld %d\n",4ll*a*b,1);continue;}
        a=u,b=v,c=w;
        x=(1ll*f[a-1]*f[b-1]%mod*f[c-1]%mod*f[a+b+c-1])%mod;
        y=(1ll*g[a+b-1]*g[b+c-1]%mod*g[c+a-1])%mod;
        printf("%lld %lld\n",1ll*u*v+1ll*v*w+1ll*w*u,x*y%mod);
    }
    return 0;
}