#include <bits/stdc++.h>
using namespace std;

using Int = long long;
const char newl = '\n';

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=Int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}


template<typename T,T MOD = 1000000007>
struct Mint{
  static constexpr T mod = MOD;
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }

  static Mint add_identity(){return Mint(0);}
  static Mint mul_identity(){return Mint(1);}

  Mint inv(){return pow(MOD-2);}

  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}

  Mint operator+(Mint a) const{return Mint(v)+=a;}
  Mint operator-(Mint a) const{return Mint(v)-=a;}
  Mint operator*(Mint a) const{return Mint(v)*=a;}
  Mint operator/(Mint a) const{return Mint(v)/=a;}

  Mint operator-() const{return v?Mint(MOD-v):Mint(v);}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}
  bool operator <(const Mint a)const{return v <a.v;}

  static Mint comb(long long n,Int k){
    Mint num(1),dom(1);
    for(Int i=0;i<k;i++){
      num*=Mint(n-i);
      dom*=Mint(i+1);
    }
    return num/dom;
  }
};
template<typename T,T MOD> constexpr T Mint<T, MOD>::mod;
template<typename T,T MOD>
ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}

//INSERT ABOVE HERE

using M = Mint<Int>;
M inv2=M(2).inv();
M calc(Int x,Int y,Int n){
  // cout<<x<<' '<<y<<' '<<n<<':'<<M(x+y)*inv2*M(n)<<endl;
  return M(x+y)*inv2*M(n);
}

signed solve(){
  Int n,a,b;
  cin>>n>>a>>b;
  if(a+b>n){
    cout<<0<<newl;
    return 0;
  }
  vector<M> vs;
  if(b <= n - a - b){
    // i in [0, B)
    // i in [B, N - A - B]
    // i in (N - A - B, N - A]
    vs.emplace_back(calc(0+a,b-1+a,b-0));
    vs.emplace_back(calc(a+b-1,a+b-1,(n-a-b)-b+1));
    vs.emplace_back(calc(a+b-1,a,(n-a)-(n-a-b)));
  }else{
    // i in [0, N - A - B]
    // i in (N - A - B, B)
    // i in [B, N - A]
    vs.emplace_back(calc(0+a,n-b,(n-a-b)-0+1));
    vs.emplace_back(calc(n-b+1,n-b+1,b-(n-a-b)-1));
    vs.emplace_back(calc(n-b,a,(n-a)-b+1));
  }
  M ans{1};
  ans*=M(n-a+1)*M(n-a+1);
  ans*=M(n-b+1)*M(n-b+1);
  for(Int i=0;i<3;i++)
    for(Int j=0;j<3;j++)
      ans-=vs[i]*vs[j];
  cout<<ans<<newl;
  return 0;
}

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  Int T;
  cin>>T;
  while(T--) solve();
  return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const ll mod = 1e9 + 7;

int main() {
	ll t, n, a, b;
	scanf("%lld", &t);
	while(t--) {
		scanf("%lld%lld%lld", &n, &a, &b);
		if(a + b > n) {
			printf("0\n");
			continue;
		}
		ll tmp = (n - a - b) % mod;
		ll ans = (tmp + 1) % mod * (tmp + 2) % mod
				* (2 * (n - a + 1) % mod * (n - b + 1) % mod - (tmp + 1) % mod * (tmp + 2) % mod + mod) % mod;
		printf("%lld\n", ans);
	}
	return 0;
}