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

const int mod=1000000007;
using ll = long long;

ll sqr(ll x)
{
    x%=mod;
    return x*x%mod;
}

int main()
{
    int T;
    scanf("%d",&T);
    while (T--) {
        ll n,a,b;
        scanf("%lld%lld%lld",&n,&a,&b);
        if (a+b>n) {
            puts("0");
            continue;
        }
        if (a<b) swap(a,b);
        ll ans = 0;
        ll sum = ((n-(a+b-1)+1)+(n-(a+1)+1))%mod*(b-1)%mod;
        if (sum&1) {
            sum=(sum+mod)/2;
        } else {
            sum/=2;
        }

        ans = sum*sum%mod*4%mod;
        ans += (n-a+1)*sum%mod*(a-b+1)%mod*4%mod;
        ans += sqr(n-a+1)*sqr(a-b+1)%mod;
        ans %= mod;

        ans = sqr(n-a+1)*sqr(n-b+1)%mod - ans;
        if (ans<0) ans+=mod;
        printf("%lld\n",ans);
    }
    return 0;
}