#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vl; typedef vector vvl; typedef vector vvvl; typedef vector vvvvl; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef vector vvvvb; typedef pair pl; typedef pair ppl; typedef pair pppl; typedef pair pppppl; #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--) #define all(a) begin(a),end(a) #define sz(a) (int)(a).size() #define F first #define S second #define bs(A,x) binary_search(all(A),x) #define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin()) #define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin()) #define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x)) templateusing min_priority_queue=priority_queue,greater>; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint a){os<>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;} //*/ templateostream&operator<<(ostream&os,pairp){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vectorv){rep(i,0,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} int main(){ cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); ll _;cin>>_; vm ex(3e6,1),re(3e6); rep(i,1,sz(ex))ex[i]=i*ex[i-1]; rep(i,0,sz(re))re[i]=1/ex[i]; while(_--){ ll N,K,L;cin>>N>>K>>L; ll M=K+L-2; mint ans=0; if(N>=M+1){ ans+=2*M*(2*M+1)*ex[M+N+1]*re[2*M+2]*re[N-M-1]; ans-=2*M*(2*M+2*N+1)*ex[M+N]*re[2*M+1]*re[N-M-1]; ans+=(M+N)*(M+N)*ex[M+N-1]*re[2*M]*re[N-M-1]; } ans*=N*ex[K+L-2]*re[K-1]*re[L-1]; cout<